先贴一个最喜欢的代码看看，虽然不是本关最速或最少代码，但应该是41关正常排序后再输出的最简程序。
【41】30/1061
-- HUMAN RESOURCE MACHINE PROGRAM --
a:
INBOX
COPYTO [24]
JUMPZ c
BUMPUP 24
b:
COPYTO 24
JUMP a
c:
COMMENT 0
COPYTO 23
JUMP e
d:
COPYFROM [23]
COPYTO 24
COPYFROM [22]
COPYTO [23]
COPYFROM 24
COPYTO [22]
BUMPDN 23
e:
f:
JUMPZ g
COPYTO 22
BUMPDN 22
COPYFROM [23]
JUMPZ h
SUB [22]
JUMPN d
g:
BUMPUP 23
JUMP f
h:
COMMENT 1
COPYTO 24
i:
COPYFROM [24]
JUMPZ b
OUTBOX
BUMPUP 24
JUMP i
DEFINE COMMENT 0
eJxjYBgFo2AUjGQAAAQEAAE;
DEFINE COMMENT 1
eJxjYBgFo2AUjGQAAAQEAAE;
DEFINE LABEL 22
eJzjZ2BgmFFgn/u9oGnL3jzJO0Auw6nSP1nXaxLyztcfLfRuzC3PaKpqyGg62e3dOHmSYH3MzIbKrsVh
heeWMoyCUTAKhjwAANQYG3M;
DEFINE LABEL 23
eJzjY2BgON50zf96zfeAU6XvEw2LlxRsLTSr21pYONGwOGamYfHjuWtL1izJLp2+xq7q6Dbnlufbf7bb
b2IYBaNgFAwLAAASRBy6;
DEFINE LABEL 24
eJwTYGBgsCub37SxbX7Tsc7aep2e2nqgEENv45ZQ08b41Gv1FpXX6s+2na/T6FevN9t/tyH/yKKWicc5
2icel+uKOMQwCkbBKBjSAADgjRzS;

刚查到github成绩，太让人泄气了，感觉白玩了
不过最后41关的合格体积下最速应该是大幅破纪录了，哪位有兴趣帮忙更新一下吧

【41】20/651 （最少步）
-- HUMAN RESOURCE MACHINE PROGRAM --
a:
INBOX
JUMPZ d
COPYTO [24]
b:
BUMPUP 24
JUMP a
c:
COPYFROM [22]
OUTBOX
COPYFROM [24]
COPYTO [22]
d:
BUMPDN 24
JUMPN b
COPYTO 23
e:
COPYTO 22
f:
BUMPDN 23
JUMPN c
COPYFROM [22]
SUB [23]
JUMPN f
COPYFROM 23
JUMP e
DEFINE LABEL 22
eJyTYGBgOBV3P7kqfmWZQWJx540Ehy03EoxmP0vK6NiU7p+nmvMqxTjvVcrMAsuc5UXM9euK5TaylXjO
FSmTbCwq31/RXhWV/7ZGN/tY89fUsy08GS1tD6tvt3V1T+poXDSpQ3MTwygYBaNgUAMAs9YtMw;
DEFINE LABEL 23
eJzjY2BgON50zf96zfeAU6XvEw2LlxRsLTSr21pYONGwOGamYfHjuWtL1izJLp2+xq7q6Dbnlufbf7bb
b2IYBaNgFAwLAAASRBy6;
DEFINE LABEL 24
eJwTY2BgCCv+mupf9DXVo9A/73HeumWP8+Q2AoUZssuWxylVfE29WOGft6PxyeSMJvVZta1HVrS03V4F
kg/rSY5Y3n0icXl3TdGCLr4Gjy7W6Y6df9ZO6tDcxDAKRsEoGBIAAF7+J24;
【41】31/546 （最速）
-- HUMAN RESOURCE MACHINE PROGRAM --
JUMP c
a:
b:
COPYFROM [24]
OUTBOX
c:
INBOX
COPYTO [24]
d:
COPYFROM 24
COPYTO 22
e:
BUMPUP 24
INBOX
JUMPZ f
COPYTO [24]
SUB [22]
JUMPN d
JUMP e
f:
BUMPDN 24
JUMPZ b
COMMENT 0
g:
COPYFROM [22]
OUTBOX
COPYFROM [24]
COPYTO [22]
BUMPDN 24
JUMPZ a
COPYTO 23
h:
COPYTO 22
i:
BUMPDN 23
JUMPN g
COPYFROM [22]
SUB [23]
JUMPN i
COPYFROM 23
JUMP h
DEFINE COMMENT 0
eJxjYBgFo2AUjGQAAAQEAAE;
DEFINE LABEL 22
eJyTYGBgOBV3P7kqfmWZQWJx540Ehy03EoxmP0vK6NiU7p+nmvMqxTjvVcrMAsuc5UXM9euK5TaylXjO
FSmTbCwq31/RXhWV/7ZGN/tY89fUsy08GS1tD6tvt3V1T+poXDSpQ3MTwygYBaNgUAMAs9YtMw;
DEFINE LABEL 23
eJzjY2BgON50zf96zfeAU6XvEw2LlxRsLTSr21pYONGwOGamYfHjuWtL1izJLp2+xq7q6Dbnlufbf7bb
b2IYBaNgFAwLAAASRBy6;
DEFINE LABEL 24
eJwTY2BgCCv+mupf9DXVo9A/73HeumWP8+Q2AoUZssuWxylVfE29WOGft6PxyeSMJvVZta1HVrS03V4F
kg/rSY5Y3n0icXl3TdGCLr4Gjy7W6Y6df9ZO6tDcxDAKRsEoGBIAAF7+J24;

38关也破 Fastest That Meets Size Challenge 纪录了

【38】27/199
-- HUMAN RESOURCE MACHINE PROGRAM --
JUMP d
a:
COPYFROM 2
JUMPZ b
OUTBOX
b:
COPYFROM 1
OUTBOX
c:
COPYFROM 0
OUTBOX
d:
COMMENT 0
INBOX
COPYTO 0
SUB 10
JUMPN c
COPYFROM 9
COPYTO 1
COPYTO 2
e:
COPYFROM 0
SUB 11
JUMPN f
COPYTO 0
BUMPUP 2
JUMP e
f:
g:
COPYFROM 0
SUB 10
JUMPN a
COPYTO 0
BUMPUP 1
JUMP g

后面两列估计是最近才加上去的，我半年前看时候还没后面两列

楼主，求35关双杀方法，谢谢

【35】14/180
-- HUMAN RESOURCE MACHINE PROGRAM --
JUMP b
a:
COPYFROM [14]
OUTBOX
BUMPUP 14
b:
COMMENT 0
c:
INBOX
COPYTO [14]
COPYFROM 14
COPYTO 13
d:
BUMPDN 13
JUMPN a
COPYFROM [13]
SUB [14]
JUMPZ c
JUMP d
DEFINE COMMENT 0
eJxjYBgFo2AUjGQAAAQEAAE;
DEFINE LABEL 13
eJxjY2Bg+FOVXP2nim3NruqKHUAuQ3S1ih/DKBgFo2BEAACHOQgw;
DEFINE LABEL 14
eJwTYGBgqC28ECpXGNf7KG/ZRiCXobykN+Vz6frU8+Vshduai5a/6Zi2M6Pr9m6QXFJvZJR69/fOE12v
N3N27djFMApGwSgY0gAAlwQcwA;
【35】16/149
-- HUMAN RESOURCE MACHINE PROGRAM --
INBOX
JUMP b
a:
BUMPUP 14
COPYFROM 13
b:
COPYTO [14]
OUTBOX
COMMENT 0
c:
COPYFROM 14
COPYTO 12
INBOX
COPYTO 13
d:
SUB [12]
JUMPZ c
BUMPDN 12
JUMPN a
COPYFROM 13
JUMP d
DEFINE COMMENT 0
eJxjYBgFo2AUjGQAAAQEAAE;
DEFINE LABEL 12
eJxjZWBgeFjXX/qw7vZuIJOhsa47mGEUjIJRMGIAAMGfBzs;
DEFINE LABEL 13
eJzjZmBgWJt5uH5TGUcTkMlwp/Bi2p3Cx/lyhV7FcoVW1QwFE9sYChz3v61IOcAwCkbBKBh2AADSFRFJ
;
DEFINE LABEL 14
eJwTYGBgqC28ECpXGNf7KG/ZRiCXobykN+Vz6frU8+Vshduai5a/6Zi2M6Pr9m6QXFJvZJR69/fOE12v
N3N27djFMApGwSgY0gAAlwQcwA;

下面这个是目前35最速，用的是重复代码平铺省去循环和越界判断，差值存储的方式省去计数，算法复杂度和一般比较字母法是一样的，主要还是针对输入和循环优化在讨巧上了，不过的确挺巧妙的。
【35】42/63 by ocoss
-- HUMAN RESOURCE MACHINE PROGRAM --
-- 35-Duplicate-Removal - SIZE 42/17 - SPEED 63/167 --
INBOX
COPYTO 0
OUTBOX
COMMENT 0
a:
INBOX
COPYTO 10
SUB 0
JUMPZ a
COPYTO 1
COPYFROM 10
OUTBOX
COMMENT 1
b:
c:
INBOX
COPYTO 10
SUB 0
JUMPZ c
SUB 1
JUMPZ b
COPYTO 2
COPYFROM 10
OUTBOX
COMMENT 2
d:
e:
f:
INBOX
COPYTO 10
SUB 0
JUMPZ f
SUB 1
JUMPZ e
SUB 2
JUMPZ d
COPYTO 3
COPYFROM 10
OUTBOX
COMMENT 3
g:
h:
i:
j:
INBOX
COPYTO 10
SUB 0
JUMPZ j
SUB 1
JUMPZ i
SUB 2
JUMPZ h
SUB 3
JUMPZ g
COPYFROM 10
OUTBOX
DEFINE COMMENT 0
eJxjYWBg2Fui5tJanlr4pmrRfoZRMApGwYgCAL/hBjk;
DEFINE COMMENT 1
eJzjZ2BgCMy9EllcIRu6tVY29FrH0aiA7pr49L6mfLZ++5b0voYJPT0XZqt16i170jx7fWv55AMsdRFH
Ts/zPMowCkbBKBjyAAAfsBuN;
DEFINE COMMENT 2
eJwTZmBgeJ+7wdu256ynwcTJvisnRwSaTuUPa5l6NKplak38j8miaT09WqUWHQ8q0/tOdi/pfztzSf+m
ue+6mVZObb6z+0zD/r1+VYv2fyn8tZNhFIyCUTDkAACqnCdh;
DEFINE COMMENT 3
eJzjYWBgeJVpHXwja1ntjaxNcx8VVSyUbmxb8Ltt01zG7k1zgdIM3u0rYrzbt5972c52i2EUjIJRMKwA
AChjFjs;
DEFINE LABEL 10
eJzjZWBgiMuYnxuY+7XjUdGSecUV+Zv0GnSOA4UZguvW5fhVKbatKr0w+32u2vbCdP6TdUm5lxlGwSgY
BcMGAAAk1xZL;

41关就是常数优化大赛，selection sort比quick sort快系列

2L:
template<class BidIt, class PredT>
void gnome_sort(BidIt first, BidIt last, PredT cmpLT) {
for (BidIt cur = first, prev; cur != last; prev = cur)
if (cur == first || !cmpLT(*cur, *--prev)) ++cur;
else swap(*prev, *cur--);
}

lz我没找到你的38关最快解啊？
目前虽然我量了两盏灯，但是最快解看起来有点蠢（每减一次，看一下负了没有，负了加回来，存回去，然后结账看减过多少次，不负的话继续减），于是想参考一下你的方法。

我看了一下，我“质数工厂”那关的最快比LZ快，好自豪（39行代码，不算太冗赘，也没有把2和3拿出来单独分析平均238步）

质数工厂我目前做到了最短26行，平均速度348
最快速度238，用了39行