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 20:35Victor MerckléVictor MerckléScore: 2,629Success
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 20:402,55529,228,56720,955,000024,576stderr
2Sep 8, 2026 20:402,55629,486,64920,962,000024,576stderr
3Sep 8, 2026 20:402,56729,617,87821,050,000024,576stderr
4Sep 8, 2026 20:402,62430,045,61721,521,000024,576stderr
5Sep 8, 2026 20:402,62930,728,82421,560,000024,576stderr
6Sep 8, 2026 20:402,63429,786,48421,600,000024,576stderr
7Sep 8, 2026 20:402,63530,104,55720,599,0001,013,00024,576stderr
8Sep 8, 2026 20:402,63830,064,61921,635,000024,576stderr
9Sep 8, 2026 20:402,65430,952,44321,763,000024,576stderr