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 07:08Josu San MartinJosu San MartinScore: 3,068Success
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 07:103,05935,818,74124,056,0001,031,0002,121,728stderr
2Sep 4, 2026 07:103,06435,182,19624,100,0001,026,0002,121,728stderr
3Sep 4, 2026 07:103,06535,802,56124,108,0001,028,0002,121,728stderr
4Sep 4, 2026 07:103,06735,178,84824,130,0001,027,0002,121,728stderr
5Sep 4, 2026 07:103,06835,823,90524,126,0001,032,0002,121,728stderr
6Sep 4, 2026 07:103,07435,212,24124,184,0001,029,0002,121,728stderr
7Sep 4, 2026 07:103,08135,178,73724,241,0001,026,0002,121,728stderr
8Sep 4, 2026 07:103,08635,309,91424,274,0001,036,0002,121,728stderr
9Sep 4, 2026 07:1015,272135,264,146124,225,0001,006,0002,121,728stderr