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:12Josu San MartinJosu San MartinScore: 3,624Success
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:123,56642,294,61028,221,0001,025,0002,125,824stderr
2Sep 3, 2026 23:123,58339,334,99028,360,0001,028,0002,121,728stderr
3Sep 3, 2026 23:123,59239,417,50828,430,0001,031,0002,121,728stderr
4Sep 3, 2026 23:123,60039,564,72728,496,0001,024,0002,121,728stderr
5Sep 3, 2026 23:123,62439,666,23028,684,0001,038,0002,121,728stderr
6Sep 3, 2026 23:123,62839,758,12028,707,0001,047,0002,121,728stderr
7Sep 3, 2026 23:123,63441,834,24928,766,0001,036,0002,121,728stderr
8Sep 3, 2026 23:1215,847139,912,124128,934,0001,016,0002,121,728stderr
9Sep 3, 2026 23:1215,928140,510,128129,594,0001,016,0002,121,728stderr