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 listJul 15, 2026 16:53Maya RebholzMaya RebholzScore: 7,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 16:547,64773,035,11660,246,0002,464,0002,113,536
2Jul 15, 2026 16:547,74173,845,86660,950,0002,532,0002,113,536
3Jul 15, 2026 16:547,76473,430,74961,159,0002,510,0002,113,536
4Jul 15, 2026 16:547,82874,146,18661,722,0002,471,0002,113,536
5Jul 15, 2026 16:547,86674,295,48662,020,0002,488,0002,113,536
6Jul 15, 2026 16:547,87674,532,06962,072,0002,515,0002,113,536
7Jul 15, 2026 16:547,91074,600,92062,359,0002,506,0002,113,536
8Jul 15, 2026 16:547,98475,853,21862,892,0002,577,0002,113,536
9Jul 15, 2026 16:548,13376,438,67964,300,0002,393,0002,113,536