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 listJan 18, 2026 07:05Josu San MartinJosu San MartinScore: 8,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 07:058,03690,947,32963,902,0001,996,0002,502,656
2Jan 18, 2026 07:058,03698,156,78863,902,0001,996,0002,465,792
3Jan 18, 2026 07:058,03792,554,41463,908,0001,997,0002,457,600
4Jan 18, 2026 07:058,04189,327,70564,941,000999,0002,461,696
5Jan 18, 2026 07:058,04591,001,37362,970,0002,998,0002,457,600
6Jan 18, 2026 07:058,05192,401,66363,019,0003,000,0002,461,696
7Jan 18, 2026 07:058,05887,446,33164,074,0002,002,0002,514,944
8Jan 18, 2026 07:058,07487,487,86664,202,0002,006,0002,506,752
9Jan 18, 2026 07:058,07497,704,35165,207,0001,003,0002,506,752