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 07:37Victor MerckléVictor MerckléScore: 3,754Success
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 07:383,41437,027,18121,113,0006,888,00024,576stderr
2Sep 8, 2026 07:383,45336,667,39421,158,0007,161,00024,576stderr
3Sep 8, 2026 07:383,51237,067,43720,922,0007,883,00024,576stderr
4Sep 8, 2026 07:383,74839,036,19821,276,0009,464,00024,576stderr
5Sep 8, 2026 07:383,75439,178,25621,518,0009,265,00024,576stderr
6Sep 8, 2026 07:383,82841,209,03321,196,00010,198,00024,576stderr
7Sep 8, 2026 07:383,94941,471,18321,476,00010,909,00024,576stderr
8Sep 8, 2026 07:384,79647,748,80121,422,00017,908,00024,576stderr
9Sep 8, 2026 07:386,93265,184,79143,485,00013,358,00024,576stderr