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 3, 2026 04:14Josu San MartinJosu San MartinScore: 4,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:144,11844,564,94131,477,0002,291,0002,113,536
2Sep 3, 2026 04:144,15444,395,66331,798,0002,271,0002,113,536
3Sep 3, 2026 04:144,15744,950,96532,034,0002,060,0002,113,536
4Sep 3, 2026 04:144,17545,039,40531,962,0002,274,0002,113,536
5Sep 3, 2026 04:144,17745,092,11032,189,0002,068,0002,113,536
6Sep 3, 2026 04:144,19544,470,82932,328,0002,079,0002,113,536
7Sep 3, 2026 04:144,21145,035,09832,480,0002,058,0002,113,536
8Sep 3, 2026 04:1412,184110,010,46893,692,0006,220,0002,113,536
9Sep 3, 2026 04:1412,328111,473,70094,637,0006,454,0002,113,536