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 4, 2026 06:35Josu San MartinJosu San MartinScore: 3,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:363,05234,974,79824,005,0001,024,0002,121,728stderr
2Sep 4, 2026 06:363,06935,147,38324,121,0001,050,0002,121,728stderr
3Sep 4, 2026 06:363,08535,264,18124,275,0001,030,0002,121,728stderr
4Sep 4, 2026 06:363,08636,008,18224,272,0001,034,0002,121,728stderr
5Sep 4, 2026 06:363,08935,315,48224,296,0001,034,0002,121,728stderr
6Sep 4, 2026 06:363,08936,622,71924,307,0001,029,0002,121,728stderr
7Sep 4, 2026 06:3615,247134,973,823123,998,0001,033,0002,121,728stderr
8Sep 4, 2026 06:3615,255135,721,404124,062,0001,035,0002,121,728stderr
9Sep 4, 2026 06:3615,287135,353,220124,350,0001,006,0002,121,728stderr