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:22Victor MerckléVictor MerckléScore: 3,510Success
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:223,20834,720,44220,615,0005,696,00024,576stderr
2Sep 8, 2026 17:223,27435,021,64320,499,0006,351,00024,576stderr
3Sep 8, 2026 17:223,31735,419,01320,660,0006,543,00024,576stderr
4Sep 8, 2026 17:223,32635,621,93320,586,0006,688,00024,576stderr
5Sep 8, 2026 17:223,51038,554,41921,209,0007,581,00024,576stderr
6Sep 8, 2026 17:223,55837,523,56020,912,0008,265,00024,576stderr
7Sep 8, 2026 17:223,59937,718,90221,042,0008,475,00024,576stderr
8Sep 8, 2026 17:223,67739,246,41621,242,0008,913,00024,576stderr
9Sep 8, 2026 17:226,61962,479,80144,666,0009,611,00024,576stderr