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 listSep 8, 2026 11:01Victor MerckléVictor MerckléScore: 2,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 11:022,56429,222,96321,030,000024,576stderr
2Sep 8, 2026 11:022,56729,277,55421,051,000024,576stderr
3Sep 8, 2026 11:022,61730,080,34321,464,000024,576stderr
4Sep 8, 2026 11:022,62829,739,53221,556,000024,576stderr
5Sep 8, 2026 11:022,63831,042,69721,637,000024,576stderr
6Sep 8, 2026 11:022,64030,008,01421,650,000024,576stderr
7Sep 8, 2026 11:022,64329,822,49821,680,000024,576stderr
8Sep 8, 2026 11:022,64830,817,77621,721,000024,576stderr
9Sep 8, 2026 11:022,65930,034,81221,811,000024,576stderr