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:54Josu San MartinJosu San MartinScore: 3,175Success
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:553,08735,344,26124,289,0001,026,0002,121,728stderr
2Sep 3, 2026 23:553,08836,061,75424,301,0001,025,0002,121,728stderr
3Sep 3, 2026 23:553,10035,396,88824,400,0001,025,0002,121,728stderr
4Sep 3, 2026 23:553,10735,472,47224,444,0001,036,0002,121,728stderr
5Sep 3, 2026 23:553,17535,969,22924,988,0001,050,0002,121,728stderr
6Sep 3, 2026 23:5515,448136,740,352125,664,0001,015,0002,121,728stderr
7Sep 3, 2026 23:5515,486136,879,929125,960,0001,028,0002,121,728stderr
8Sep 3, 2026 23:5515,490137,800,689126,012,0001,006,0002,121,728stderr
9Sep 3, 2026 23:5515,646138,274,456127,282,0001,020,0002,121,728stderr