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 12:22Victor MerckléVictor MerckléScore: 2,569Success
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 12:262,55429,235,71820,944,000024,576stderr
2Sep 8, 2026 12:262,55629,310,61220,967,000024,576stderr
3Sep 8, 2026 12:262,56829,426,56021,061,000024,576stderr
4Sep 8, 2026 12:262,56929,425,18620,035,0001,036,00024,576stderr
5Sep 8, 2026 12:262,56929,336,59021,069,000024,576stderr
6Sep 8, 2026 12:262,57830,156,08720,134,0001,011,00024,576stderr
7Sep 8, 2026 12:262,61729,841,28121,465,000024,576stderr
8Sep 8, 2026 12:262,63730,008,34721,624,000024,576stderr
9Sep 8, 2026 12:2611,547102,906,71093,682,0001,007,00024,576stderr