TIS-100 Bench: Interrupt Handler

Monitor four streams and report which one changes from 0 to 1. Previous values must be remembered independently.

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
169best LLM cycles (122 community)
0new frontier points

Records

ScoreCommunity bestBest LLMModel
Cycles122169GPT-6 Astra · +39%
Nodes66DeepSeek V4.1 Flash Ties record
Instructions2123GPT-6.1 Sol · +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 AstraYes169624—
02GPT-6.1 SolYes169623—
03Gemini 4 ArgonYes169631—
04Muse Wonder 1.0Yes171639—
05Opus 5.5Yes173631—
06Muse Spark 1.3Yes185639—
07Sonnet 5.5Yes185639—
08Gemini 3.8 FlashYes197624—
09Kimi K3.1 ProYes197634—
10Fable 5.1Yes198633—
11Grok 4.7Yes201950—
12Haiku 5.5Yes215743—
13DeepSeek V4.1 FlashYes266627—
14GPT-6 LunaYes335744—
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.

GPT-6.1 Sol Fewest cycles

169 cycles · 10 nodes · 44 instructions33762.169-10-44.txt on GitHub

GPT-6.1 Sol program running on 33762 in TIS-100
Node 0
Z: MOV UP ACC
JEZ O
MOV 1 DOWN
JMP H
K: MOV 0 DOWN
H: MOV UP ACC
JNZ K
O: MOV 0 DOWN
Node 1
Z: MOV UP ACC
JEZ O
MOV 2 DOWN
JMP H
K: MOV 0 DOWN
H: MOV UP ACC
JNZ K
O: MOV 0 DOWN
Node 2
Z: MOV UP ACC
JEZ O
MOV 3 DOWN
JMP H
K: MOV 0 DOWN
H: MOV UP ACC
JNZ K
O: MOV 0 DOWN
Node 3
Z: MOV UP ACC
JEZ O
MOV 4 DOWN
JMP H
K: MOV 0 DOWN
H: MOV UP ACC
JNZ K
O: MOV 0 DOWN
Node 4
MOV UP RIGHT
Node 5
MOV UP ACC
ADD LEFT
MOV ACC DOWN
Node 6
MOV UP ACC
ADD RIGHT
MOV ACC DOWN
Node 7
MOV UP LEFT
Node 8
MOV UP RIGHT
Node 9
MOV UP ACC
ADD LEFT
MOV ACC DOWN

Sonnet 5.5 Fewest nodes

247 cycles · 6 nodes · 41 instructions33762.247-6-41.txt on GitHub

Sonnet 5.5 program running on 33762 in TIS-100
Node 0
A: MOV UP,ACC
MOV ACC,RIGHT
JEZ A
B: MOV UP,ACC
MOV 0,RIGHT
JNZ B
Node 1
A: MOV UP,ACC
JEZ Z
MOV LEFT,ACC
ADD 2
MOV ACC,RIGHT
B: MOV UP,ACC
JEZ Z
MOV LEFT,RIGHT
JMP B
Z: MOV LEFT,RIGHT
Node 2
A: MOV UP,ACC
JEZ Z
MOV LEFT,ACC
ADD RIGHT
ADD 3
MOV ACC,DOWN
B: MOV LEFT,ACC
ADD RIGHT
MOV ACC,DOWN
MOV UP,ACC
JNZ B
JMP A
Z: MOV LEFT,ACC
ADD RIGHT
MOV ACC,DOWN
Node 3
A: MOV UP,ACC
JEZ Z
MOV 4,LEFT
B: MOV UP,ACC
JEZ Z
MOV 0,LEFT
JMP B
Z: MOV 0,LEFT
Node 6
MOV UP,DOWN
Node 9
MOV UP,DOWN

GPT-6.1 Sol Fewest instructions

338 cycles · 6 nodes · 23 instructions33762.338-6-23.txt on GitHub

GPT-6.1 Sol program running on 33762 in TIS-100
Node 0
MOV UP RIGHT
Node 1
MOV UP ACC
ADD ACC
ADD LEFT
MOV ACC RIGHT
Node 2
MOV UP ACC
JEZ O
MOV 3 ACC
O: ADD LEFT
ADD RIGHT
MOV ACC DOWN
MOV ACC DOWN
Node 3
MOV UP ACC
ADD ACC
ADD ACC
MOV ACC LEFT
Node 6
MOV UP DOWN
Node 9
SUB UP
NEG
JGZ O
MOV 0 ACC
O: MOV ACC DOWN
MOV UP ACC