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 19, 2026 19:22Andrew EpsteinAndrew EpsteinScore: 3,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:222,97934,892,54222,593,0001,842,0002,121,728stderr
2Sep 19, 2026 19:222,98034,832,05422,647,0001,790,0002,121,728stderr
3Sep 19, 2026 19:222,98134,829,61422,656,0001,794,0002,121,728stderr
4Sep 19, 2026 19:223,01135,205,59222,830,0001,867,0002,121,728stderr
5Sep 19, 2026 19:223,01135,111,71522,847,0001,851,0002,121,728stderr
6Sep 19, 2026 19:2217,470153,765,220141,517,0001,740,0002,121,728stderr
7Sep 19, 2026 19:2217,980157,845,790145,702,0001,735,0002,121,728stderr
8Sep 19, 2026 19:2218,040158,440,174145,193,0002,741,0002,121,728stderr
9Sep 19, 2026 19:2218,164159,461,045147,211,0001,740,0002,121,728stderr