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:47Victor MerckléVictor MerckléScore: 5,610Success
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:482,98432,679,11622,974,0001,499,00024,576stderr
2Sep 8, 2026 08:483,06133,530,08422,220,0002,883,00024,576stderr
3Sep 8, 2026 08:483,45136,650,66922,150,0006,156,00024,576stderr
4Sep 8, 2026 08:483,61938,016,36122,291,0007,388,00024,576stderr
5Sep 8, 2026 08:485,61055,784,98844,986,0001,021,00024,576stderr
6Sep 8, 2026 08:485,66655,521,48944,180,0002,285,00024,576stderr
7Sep 8, 2026 08:486,01757,703,99543,912,0005,435,00024,576stderr
8Sep 8, 2026 08:486,17659,023,04344,683,0005,966,00024,576stderr
9Sep 8, 2026 08:486,33660,368,19944,276,0007,681,00024,576stderr