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 08:35Victor MerckléVictor MerckléScore: 2,611Success
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 08:362,60229,597,68321,344,000024,576stderr
2Sep 8, 2026 08:362,60329,739,36221,349,000024,576stderr
3Sep 8, 2026 08:362,60529,726,20321,363,000024,576stderr
4Sep 8, 2026 08:362,60829,749,40021,392,000024,576stderr
5Sep 8, 2026 08:362,61131,099,77321,417,000024,576stderr
6Sep 8, 2026 08:365,34652,111,93542,826,0001,014,00024,576stderr
7Sep 8, 2026 08:365,34952,082,93142,855,0001,014,00024,576stderr
8Sep 8, 2026 08:365,34952,082,82642,852,0001,014,00024,576stderr
9Sep 8, 2026 08:365,36253,096,84042,955,0001,015,00024,576stderr