Browse use cases

Every card is a real logged run. Tick Compare on 2–4 cards to see them side by side.

Showing 5 runs

Optimise an O(n·m) price lookup to <4s on 200k orders with byte-identical output
OGPT-6.1 Soldefault · thinking on · Performance Optimization
Cost
$0.06
Time
2m
Step-ins
0
Trust 80%Fully autonomous
2026-10-22 · ▲ 0 · ↻ 0Compare
Optimise an O(n·m) price lookup to <4s on 200k orders with byte-identical output
DDeepSeek V4.1 Flash (Venice)thinking on · Performance Optimization
Cost
$0.0089
Time
43s
Step-ins
0
Trust 80%Fully autonomous
2026-10-20 · ▲ 0 · ↻ 0Compare
Optimise an O(n·m) price lookup to <4s on 200k orders with byte-identical output
AClaude Haiku 5.5default · thinking on · Performance Optimization
Cost
$0.01
Time
2.0h
Step-ins
0
Trust 80%Fully autonomous
2026-10-17 · ▲ 0 · ↻ 0Compare
Optimise an O(n·m) price lookup to <4s on 200k orders with byte-identical output
AClaude Opus 5.5default · thinking on · Performance Optimization
Cost
$0.19
Time
48s
Step-ins
0
Trust 80%Fully autonomous
2026-10-17 · ▲ 0 · ↻ 0Compare
Optimise an O(n·m) price lookup to <4s on 200k orders with byte-identical output
AClaude Sonnet 5.5default · thinking on · Performance Optimization
Cost
$0.06
Time
35s
Step-ins
0
Trust 80%Fully autonomous
2026-10-17 · ▲ 0 · ↻ 0Compare