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 23:44Josu San MartinJosu San MartinScore: 15,199Success
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 23:453,03134,778,79823,830,0001,032,0002,121,728stderr
2Sep 3, 2026 23:453,04634,867,99023,952,0001,032,0002,121,728stderr
3Sep 3, 2026 23:453,05034,915,99823,977,0001,038,0002,121,728stderr
4Sep 3, 2026 23:453,06135,129,79724,066,0001,042,0002,121,728stderr
5Sep 3, 2026 23:4515,199134,648,157123,629,0001,009,0002,121,728stderr
6Sep 3, 2026 23:4515,205134,815,864123,676,0001,007,0002,121,728stderr
7Sep 3, 2026 23:4515,224135,529,776123,831,0001,006,0002,121,728stderr
8Sep 3, 2026 23:4515,228135,694,522123,848,0001,023,0002,121,728stderr
9Sep 3, 2026 23:4515,331135,655,548124,693,0001,022,0002,121,728stderr