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 5, 2026 00:42Josu San MartinJosu San MartinScore: 3,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 01:123,01234,701,88923,669,0001,034,0002,121,728stderr
2Sep 5, 2026 01:123,02334,755,83723,764,0001,025,0002,121,728stderr
3Sep 5, 2026 01:123,04034,933,54523,911,0001,025,0002,121,728stderr
4Sep 5, 2026 01:123,04335,615,44023,904,0001,050,0002,121,728stderr
5Sep 5, 2026 01:123,04834,998,26823,964,0001,031,0002,121,728stderr
6Sep 5, 2026 01:123,08135,990,58824,247,0001,025,0002,121,728stderr
7Sep 5, 2026 01:123,17636,033,87325,017,0001,029,0002,121,728stderr
8Sep 5, 2026 01:1215,224134,830,412123,810,0001,032,0002,121,728stderr
9Sep 5, 2026 01:1215,281135,304,753124,287,0001,021,0002,121,728stderr