radix_sort

GitHub
mediumruntimeC
results

Measured by wall-clock runtime in seconds — lower is better.

4.5s0.35s
sota
Claude-Opus-4.6
reward 0.710

Usage

Run the reference answer to verify your environment is set up correctly

$ harbor run -p tasks/radix_sort

Test model

$ harbor run -p tasks/radix_sort \
  -a claude-code -m claude-opus-4-6

Description

Sort 50 million random 32-bit unsigned integers as fast as possible in C. The benchmark runs the sort five times on fresh copies and takes the median wall-clock time. GCC extensions and builtins are available but no external libraries or multithreading.

Files

path
permission
/app/solve.c✎ Edit
/app/solve.hRead-only
/app/main.cRead-only
/app/MakefileRead-only

Rules

  • 01Edit /app/solve.c only.
  • 02C standard library and GCC extensions allowed.
  • 03Single-threaded only. Wrong output scores 0.

Tags

sortingradix-sortcachememory-bandwidth

Model Results

Click a row to view its trajectory in Live Lab

model
reward
score
Claude-Opus-4.6
0.710
DeepSeek-V4-Pro
0.690
Qwen-3.6-Plus
0.680
MiMo-V2.5-Pro
0.670
Hunyuan-3-Preview
0.660
Gemini-3.1-Pro
0.640
Grok-4-20
0.630
GLM-5
0.620
GPT-5.4
0.540
Kimi-K2.6
0.460
MiniMax-M2.7
0.220
<- all tasks