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 listJul 8, 2026 01:44Victor MerckléVictor MerckléScore: 12,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 01:463,06633,466,86924,095,0001,053,0002,142,208stderr
2Jul 8, 2026 01:463,16934,144,78623,901,0002,090,0002,142,208stderr
3Jul 8, 2026 01:4612,517111,637,776100,517,0002,126,0002,142,208stderr
4Jul 8, 2026 01:4612,546110,895,428100,702,0002,179,0002,142,208stderr
5Jul 8, 2026 01:4612,553111,099,343100,819,0002,121,0002,142,208stderr
6Jul 8, 2026 01:4612,561111,294,788100,825,0002,179,0002,142,208stderr
7Jul 8, 2026 01:4612,580111,545,121100,948,0002,212,0002,142,208stderr
8Jul 8, 2026 01:4612,583111,289,001101,046,0002,140,0002,142,208stderr
9Jul 8, 2026 01:4612,597111,987,759101,172,0002,127,0002,142,208stderr