TIS-100 Bench: Histogram Viewer

53897 Easy Image generation Streaming state Built-in puzzle · TIS-100 Bench report →

Turn successive input values into adjacent vertical bars. Each value controls a bar's length and advances the drawing position.

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
2,080best LLM cycles (1,201 community)
0new frontier points

Records

ScoreCommunity bestBest LLMModel
Cycles1,2012,080GPT-6.1 Sol · +73%
Nodes44DeepSeek V4.1 Flash Ties record
Instructions1416GPT-6.1 Sol · +14%

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.1 SolYes2,080416—
02Fable 5.1Yes2,466417—
03GPT-6 AstraYes2,466417—
04Opus 5.5Yes2,499417—
05Gemini 3.8 FlashYes2,527424—
06Kimi K3.1 ProYes2,527420—
07Sonnet 5.5Yes2,529418—
08Haiku 5.5Yes2,557417—
09DeepSeek V4.1 FlashYes2,586422—
10Muse Wonder 1.0Yes2,588429—
11Grok 4.7Yes2,616524—
12Muse Spark 1.3Yes2,646431—
13Gemini 4 ArgonYes3,389416—
14GPT-6 LunaYes4,213425—
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

2,080 cycles · 7 nodes · 73 instructions53897.2080-7-73.txt on GitHub

GPT-6.1 Sol program running on 53897 in TIS-100
Node 1
MOV UP ACC
MOV ACC RIGHT
MOV ACC DOWN
Node 2
S: MOV LEFT ACC
SUB 7
JGZ P
NEG
JNZ N
MOV 1 ACC
N: MOV 0 DOWN
SUB 1
JGZ N
JMP S
P: MOV 3 DOWN
SUB 1
JGZ P
Node 5
S: MOV UP ACC
SUB 7
JGZ P
NEG
JEZ Z
MOV ACC DOWN
MOV 11 DOWN
JMP S
P: MOV ACC DOWN
NEG
ADD 11
MOV ACC DOWN
JMP S
Z: MOV 1 DOWN
MOV 18 DOWN
Node 6
MOV UP DOWN
Node 8
MOV UP ACC
SAV
MOV UP ACC
SWP
L: SWP
MOV ACC RIGHT
ADD 1
SWP
SUB 1
JEZ E
MOV 0 RIGHT
JMP L
E: MOV 1 RIGHT
Node 9
MOV 77 ACC
A: MOV RIGHT DOWN
MOV RIGHT DOWN
MOV RIGHT DOWN
SUB 1
JGZ A
MOV 0 ACC
B: MOV ACC DOWN
MOV LEFT DOWN
MOV UP DOWN
MOV -1 DOWN
ADD LEFT
JMP B
Node 10
MOV -7 ACC
S: ADD 18
MOV 0 LEFT
MOV ACC LEFT
SWP
MOV 15 ACC
L: MOV 3 LEFT
MOV 3 LEFT
SUB 1
JGZ L
SWP
MOV -1 LEFT
SUB 17
JLZ S
MOV UP NIL

GPT-6.1 Sol Fewest nodes

2,468 cycles · 4 nodes · 17 instructions53897.2468-4-17.txt on GitHub

GPT-6.1 Sol program running on 53897 in TIS-100
Node 1
MOV UP ACC
NEG
JMP L
C: MOV 0 DOWN
L: ADD 18
MOV ACC DOWN
SUB 17
JLZ C
MOV 1 DOWN
Node 5
MOV ACC DOWN
MOV UP DOWN
ADD UP
Node 8
MOV UP RIGHT
Node 9
MOV LEFT DOWN
MOV LEFT DOWN
MOV 3 DOWN
MOV -1 DOWN

GPT-6.1 Sol Fewest instructions

2,775 cycles · 4 nodes · 16 instructions53897.2775-4-16.txt on GitHub

GPT-6.1 Sol program running on 53897 in TIS-100
Node 1
MOV UP DOWN
Node 5
S: MOV UP ACC
NEG
JMP L
C: MOV 0 RIGHT
L: ADD 18
MOV ACC RIGHT
SUB 17
JLZ C
MOV 1 RIGHT
Node 6
MOV LEFT DOWN
Node 9
MOV ACC DOWN
MOV UP DOWN
MOV 3 DOWN
MOV -1 DOWN
ADD UP