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 17:39Victor MerckléVictor MerckléScore: 2,586Success
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 17:402,54929,188,35020,905,000024,576stderr
2Sep 8, 2026 17:402,55529,340,21220,952,000024,576stderr
3Sep 8, 2026 17:402,55629,338,10220,966,000024,576stderr
4Sep 8, 2026 17:402,55630,714,63220,964,000024,576stderr
5Sep 8, 2026 17:402,58629,468,11921,211,000024,576stderr
6Sep 8, 2026 17:402,61329,644,98221,427,000024,576stderr
7Sep 8, 2026 17:402,62630,155,39821,537,000024,576stderr
8Sep 8, 2026 17:402,63130,058,65421,582,000024,576stderr
9Sep 8, 2026 17:405,46353,072,75543,789,0001,015,00024,576stderr