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 22:27Josu San MartinJosu San MartinScore: 15,527Success
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 22:2815,301135,435,841124,463,0001,013,0002,121,728stderr
2Sep 3, 2026 22:2815,315135,588,454124,578,0001,011,0002,121,728stderr
3Sep 3, 2026 22:2815,324136,342,166124,657,0001,006,0002,121,728stderr
4Sep 3, 2026 22:2815,343135,734,646124,797,0001,016,0002,121,728stderr
5Sep 3, 2026 22:2815,527137,347,697126,313,0001,015,0002,121,728stderr
6Sep 3, 2026 22:2815,531138,155,804126,352,0001,009,0002,121,728stderr
7Sep 3, 2026 22:2815,555137,884,615126,531,0001,022,0002,121,728stderr
8Sep 3, 2026 22:2815,555137,550,794126,540,0001,011,0002,121,728stderr
9Sep 3, 2026 22:2815,575138,432,515126,715,0001,006,0002,121,728stderr