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 2, 2026 19:25Josu San MartinJosu San MartinScore: 4,511Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 19:294,44047,151,61834,159,0002,252,0002,113,536
2Sep 2, 2026 19:294,45046,505,87734,293,0002,199,0002,113,536
3Sep 2, 2026 19:294,48346,794,89234,540,0002,228,0002,113,536
4Sep 2, 2026 19:294,49947,675,47534,643,0002,255,0002,113,536
5Sep 2, 2026 19:294,51147,800,91434,638,0002,360,0002,113,536
6Sep 2, 2026 19:294,55047,386,45335,092,0002,221,0002,113,536
7Sep 2, 2026 19:294,63448,305,74635,644,0002,356,0002,113,536
8Sep 2, 2026 19:2915,395137,019,296124,049,0002,194,0002,117,632
9Sep 2, 2026 19:2915,466136,849,173124,568,0002,259,0002,117,632