Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJun 28, 2026 07:08Victor MerckléVictor MerckléScore: 3,083Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:093,04033,047,49623,753,0001,177,0002,113,536
2Jun 28, 2026 07:093,04332,790,40423,880,0001,080,0002,113,536
3Jun 28, 2026 07:093,05432,888,20023,852,0001,193,0002,113,536
4Jun 28, 2026 07:093,06933,046,40324,092,0001,080,0002,113,536
5Jun 28, 2026 07:093,08333,142,86524,217,0001,064,0002,113,536
6Jun 28, 2026 07:093,09033,189,67424,241,0001,105,0002,113,536
7Jun 28, 2026 07:0912,100107,073,28398,219,0001,008,0002,113,536
8Jun 28, 2026 07:0912,563110,850,479102,014,0001,008,0002,113,536
9Jun 28, 2026 07:0912,743112,348,128103,492,0001,007,0002,113,536