TIS-100 Bench: Sequence Counter

Compute the sum and length of each zero-terminated sequence. The delimiter resets both running totals.

In TIS-100 Bench, 16 LLMs each had one attempt at this TIS-100 puzzle, with 10 minutes to find a working program and keep improving it, without seeing the community leaderboard. 14 of 16 models solved it. No model found a new Pareto-frontier point beyond the community leaderboard.

14 / 16models solved it
195best LLM cycles (112 community)
0new frontier points

Records

ScoreCommunity bestBest LLMModel
Cycles112195Muse Wonder 1.0 · +74%
Nodes44DeepSeek V4.1 Flash Ties record
Instructions1316GPT-6 Astra · +23%

Community records from the community leaderboard when we froze it. A record counts only after fresh-game replay and 100,000 passing random tests.

Pareto frontier

Pareto explorer

Lower is better ↙
Loading interactive Pareto explorer…
Community leaderboardModel frontier pointNew frontier point
Select a point with the mouse or keyboard to inspect its scores and program.

Search over time

Loading puzzle trajectories…

Every model

ModelSolvedBest cyclesBest nodesBest instructionsNew frontier points
01Muse Wonder 1.0Yes195420—
02GPT-6.1 SolYes203419—
03Sonnet 5.5Yes203419—
04Kimi K3.1 ProYes204419—
05GPT-6 AstraYes205416—
06Gemini 3.8 FlashYes218421—
07Gemini 4 ArgonYes219416—
08Opus 5.5Yes224419—
09DeepSeek V4.1 FlashYes237421—
10Muse Spark 1.3Yes251422—
11GPT-6 LunaYes251519—
12Fable 5.1Yes278418—
13Haiku 5.5Yes290420—
14Grok 4.7Yes321626—
15GLM-5.3No————
16MiMo-V2.6-ProNo————

Best scores can come from different programs. New frontier points are not matched or beaten on all three scores by any community program.

Best model programs

These programs are in TIS-100 save format and released under the MIT License. All of this puzzle’s model programs are on GitHub and Hugging Face.

Muse Wonder 1.0 Fewest cycles

195 cycles · 5 nodes · 27 instructions31904.195-5-27.txt on GitHub

Muse Wonder 1.0 program running on 31904 in TIS-100
Node 1
MOV UP, DOWN
Node 4
L: MOV UP, ACC
JEZ Z
MOV ACC, DOWN
MOV UP, ACC
JEZ Z
MOV ACC, DOWN
JMP L
Z: MOV -999, DOWN
MOV -999, RIGHT
Node 5
MOV LEFT, DOWN
Node 8
L: ADD UP
JLZ E
MOV 1, RIGHT
ADD UP
JLZ E
MOV 1, RIGHT
JMP L
E: ADD 999
MOV ACC, DOWN
MOV 0, ACC
Node 9
L: ADD ANY
JLZ E
JMP L
E: ADD 999
MOV ACC, DOWN
MOV 0, ACC

GPT-6 Astra Fewest nodes

208 cycles · 4 nodes · 20 instructions31904.208-4-20.txt on GitHub

GPT-6 Astra program running on 31904 in TIS-100
Node 1
MOV UP ACC
JNZ O
MOV 999 ACC
O: MOV ACC DOWN
Node 4
MOV -999 ACC
ADD UP
JLZ C
JMP E
C: MOV 1 DOWN
ADD UP
JLZ C
E: MOV 3 DOWN
MOV ACC DOWN
Node 8
L: JRO UP
ADD 1
JMP L
MOV UP DOWN
MOV ACC RIGHT
MOV 0 ACC
Node 9
MOV LEFT DOWN

GPT-6 Astra Fewest instructions

224 cycles · 5 nodes · 16 instructions31904.224-5-16.txt on GitHub

GPT-6 Astra program running on 31904 in TIS-100
Node 1
MOV UP ACC
JNZ O
MOV 999 ACC
O: MOV ACC DOWN
Node 4
MOV -999 ACC
L: MOV -1 RIGHT
ADD UP
JLZ L
MOV 1 RIGHT
MOV ACC DOWN
Node 5
MOV -2 ACC
ADD 1
JRO LEFT
MOV ACC DOWN
Node 8
MOV UP DOWN
Node 9
MOV UP DOWN