TIS-100 Bench: Integer Series Calculator

Sum every integer from 1 through the input value. Construct the arithmetic using the available primitive operations.

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. 15 of 16 models solved it. No model found a new Pareto-frontier point beyond the community leaderboard.

15 / 16models solved it
907best LLM cycles (264 community)
0new frontier points

Records

ScoreCommunity bestBest LLMModel
Cycles264907GPT-6 Astra · +244%
Nodes33DeepSeek V4.1 Flash Ties record
Instructions1011Fable 5.1 · +10%

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
01GPT-6 AstraYes907312—
02GPT-6.1 SolYes962312—
03Sonnet 5.5Yes1,016311—
04DeepSeek V4.1 FlashYes1,079313—
05Opus 5.5Yes1,358312—
06Fable 5.1Yes1,681311—
07Kimi K3.1 ProYes1,953312—
08Gemini 3.8 FlashYes2,808314—
09GLM-5.3Yes4,129311—
10Haiku 5.5Yes4,204317—
11Muse Wonder 1.0Yes4,385314—
12Gemini 4 ArgonYes4,779312—
13GPT-6 LunaYes5,063315—
14Muse Spark 1.3Yes6,036319—
15Grok 4.7Yes6,037319—
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.

GPT-6 Astra Fewest cycles

907 cycles · 9 nodes · 72 instructionsNEXUS.01.874.8.907-9-72.txt on GitHub

GPT-6 Astra program running on NEXUS.01.874.8 in TIS-100
Node 0
MOV RIGHT ACC
ADD ACC
ADD ACC
SUB 6
L:MOV ACC DOWN
SUB 16
MOV -1 DOWN
JGZ L
ADD 10
JEZ E
SUB 4
JEZ E
MOV 1 ACC
E:MOV ACC DOWN
MOV 1 DOWN
Node 1
MOV UP LEFT
MOV UP DOWN
MOV UP RIGHT
Node 2
MOV LEFT ACC
ADD ACC
ADD ACC
SUB 6
L:MOV ACC DOWN
SUB 16
MOV -1 DOWN
JGZ L
ADD 10
JEZ E
SUB 4
JEZ E
MOV 1 ACC
E:MOV ACC DOWN
MOV 1 DOWN
Node 3
ADD UP
JRO UP
MOV ACC DOWN
MOV 0 ACC
Node 4
MOV UP ACC
ADD ACC
ADD ACC
SUB 6
L:MOV ACC DOWN
SUB 16
MOV -1 DOWN
JGZ L
ADD 10
JEZ E
SUB 4
JEZ E
MOV 1 ACC
E:MOV ACC DOWN
MOV 1 DOWN
Node 5
ADD UP
JRO UP
MOV ACC DOWN
MOV 0 ACC
Node 7
MOV UP ACC
JGZ O
MOV 1 ACC
O:MOV ACC RIGHT
Node 8
MOV LEFT DOWN
L:ADD UP
JRO UP
JGZ O
MOV 1 ACC
O:MOV ACC DOWN
MOV 0 ACC
MOV RIGHT DOWN
Node 9
MOV UP ACC
JGZ O
MOV 1 ACC
O:MOV ACC LEFT

GPT-6.1 Sol Fewest nodes

1,298 cycles · 3 nodes · 39 instructionsNEXUS.01.874.8.1298-3-39.txt on GitHub

GPT-6.1 Sol program running on NEXUS.01.874.8 in TIS-100
Node 1
MOV UP ACC
MOV ACC DOWN
ADD ACC
ADD ACC
ADD ACC
ADD ACC
SUB 120
JLZ E
L: MOV ACC DOWN
MOV -1 DOWN
SUB 256
JGZ L
E: MOV 0 DOWN
MOV 1 DOWN
Node 4
MOV UP ACC
SAV
MOV 0 ACC
ADD UP
JRO UP
MOV ACC DOWN
SWP
R: SUB 16
JGZ R
ADD 8
JLZ N
ADD 1
JMP O
N: NEG
O: MOV ACC DOWN
Node 8
MOV UP ACC
JRO UP
ADD 7
ADD 6
ADD 5
ADD 4
ADD 3
ADD 2
ADD 1
MOV ACC DOWN

Fable 5.1 Fewest instructions

4,129 cycles · 3 nodes · 11 instructionsNEXUS.01.874.8.4129-3-11.txt on GitHub

Fable 5.1 program running on NEXUS.01.874.8 in TIS-100
Node 1
MOV UP, DOWN
Node 4
MOV UP, ACC
L: MOV ACC, DOWN
SUB 1
JGZ L
MOV -999, DOWN
Node 8
L: ADD UP
JGZ L
ADD 999
MOV ACC, DOWN
MOV 0, ACC