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 listMay 11, 2026 22:12Victor MerckléVictor MerckléScore: 3,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 22:133,45539,285,19427,305,0001,031,0002,113,536
2May 11, 2026 22:133,48239,735,32127,503,0001,052,0002,113,536
3May 11, 2026 22:133,49440,413,24627,591,0001,060,0002,113,536
4May 11, 2026 22:133,56039,779,82127,187,0002,007,0002,113,536
5May 11, 2026 22:133,61740,732,79127,575,0002,085,0002,113,536
6May 11, 2026 22:1337,934320,340,171308,898,0002,167,0002,113,536
7May 11, 2026 22:1339,228332,564,557319,538,0002,137,0002,113,536
8May 11, 2026 22:1339,883335,972,110324,913,0002,129,0002,113,536
9May 11, 2026 22:1341,375349,669,956337,273,0002,006,0002,113,536