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 listFeb 7, 2026 05:46Josu San MartinJosu San MartinScore: 3,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 05:463,63954,348,64828,844,000994,0002,490,368
2Feb 7, 2026 05:463,64057,321,20626,866,0002,985,0002,465,792
3Feb 7, 2026 05:463,68859,322,63728,228,0002,016,0002,433,024
4Feb 7, 2026 05:463,69955,142,93327,296,0003,032,0002,355,200
5Feb 7, 2026 05:463,72152,245,62229,499,0001,017,0002,396,160
6Feb 7, 2026 05:463,76356,394,07228,865,0001,990,0002,375,680
7Feb 7, 2026 05:463,80057,732,79729,148,0002,010,0002,473,984
8Feb 7, 2026 05:4611,336113,137,91891,960,000999,0002,424,832
9Feb 7, 2026 05:4611,366118,154,90091,200,0002,004,0002,424,832