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 listMay 17, 2026 15:08M-RochatM-RochatScore: 11,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:1910,16093,538,04476,876,0006,439,0002,113,536
2May 17, 2026 15:1910,23196,235,37377,135,0006,765,0002,113,536
3May 17, 2026 15:1910,44698,658,12778,934,0006,729,0002,113,536
4May 17, 2026 15:1910,48695,922,65179,565,0006,424,0002,113,536
5May 17, 2026 15:1911,209101,833,94485,408,0006,506,0002,113,536
6May 17, 2026 15:1922,265192,373,397174,552,0008,028,0002,117,632
7May 17, 2026 15:1922,426197,127,236175,980,0007,915,0002,117,632
8May 17, 2026 15:1922,475193,620,382176,959,0007,342,0002,117,632
9May 17, 2026 15:1922,586197,397,331177,369,0007,842,0002,117,632