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 8, 2026 19:32Victor MerckléVictor MerckléScore: 2,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 19:352,55629,437,45220,967,000024,576stderr
2Sep 8, 2026 19:352,55729,438,25820,969,000024,576stderr
3Sep 8, 2026 19:352,56129,499,67721,007,000024,576stderr
4Sep 8, 2026 19:352,56229,865,73021,016,000024,576stderr
5Sep 8, 2026 19:352,56529,535,04521,033,000024,576stderr
6Sep 8, 2026 19:352,58529,653,53321,199,000024,576stderr
7Sep 8, 2026 19:352,63030,066,71921,568,000024,576stderr
8Sep 8, 2026 19:352,65830,289,61421,802,000024,576stderr
9Sep 8, 2026 19:355,44053,070,77443,593,0001,015,00024,576stderr