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 7, 2026 15:51Victor MerckléVictor MerckléScore: 5,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:522,60129,545,71921,334,000024,576stderr
2Sep 7, 2026 15:524,76147,244,73821,711,00017,330,00028,672stderr
3Sep 7, 2026 15:524,83448,090,02221,760,00017,883,00028,672stderr
4Sep 7, 2026 15:525,26051,615,94042,124,0001,013,00024,576stderr
5Sep 7, 2026 15:525,52353,637,09842,216,0003,080,00024,576stderr
6Sep 7, 2026 15:525,81855,981,31442,229,0005,482,00024,576stderr
7Sep 7, 2026 15:525,86756,461,51542,353,0005,761,00024,576stderr
8Sep 7, 2026 15:526,22859,281,63042,333,0008,742,00024,576stderr
9Sep 7, 2026 15:527,09367,214,51942,910,00015,259,00024,576stderr