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 1, 2026 14:08Victor MerckléVictor MerckléScore: 5,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:132,65830,186,93620,674,0001,123,0002,121,728stderr
2Sep 1, 2026 14:132,66330,204,36320,745,0001,095,0002,121,728stderr
3Sep 1, 2026 14:132,66430,629,47620,733,0001,117,0002,121,728stderr
4Sep 1, 2026 14:132,66530,135,81720,772,0001,086,0002,121,728stderr
5Sep 1, 2026 14:135,33352,094,90842,703,0001,028,0002,121,728stderr
6Sep 1, 2026 14:135,38952,857,82043,160,0001,036,0002,121,728stderr
7Sep 1, 2026 14:135,41555,665,64042,357,0002,048,0002,121,728stderr
8Sep 1, 2026 14:135,41652,650,85843,394,0001,025,0002,121,728stderr
9Sep 1, 2026 14:1314,492127,258,331116,777,0002,061,0002,121,728stderr