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 10:28Victor MerckléVictor MerckléScore: 3,088Success
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 10:293,07633,620,49925,227,000024,576stderr
2Sep 8, 2026 10:293,08033,764,01325,261,000024,576stderr
3Sep 8, 2026 10:293,08234,398,52625,276,000024,576stderr
4Sep 8, 2026 10:293,08633,490,09525,307,000024,576stderr
5Sep 8, 2026 10:293,08835,127,27525,329,000024,576stderr
6Sep 8, 2026 10:293,10733,659,75225,480,000024,576stderr
7Sep 8, 2026 10:293,10941,614,40825,500,000024,576stderr
8Sep 8, 2026 10:293,11540,520,80225,544,000024,576stderr
9Sep 8, 2026 10:295,87562,217,56747,163,0001,013,00024,576stderr