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 9, 2026 13:37Victor 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 9, 2026 13:392,54129,405,71820,842,000024,576stderr
2Sep 9, 2026 13:392,55129,460,68920,922,000024,576stderr
3Sep 9, 2026 13:392,55229,399,16020,929,000024,576stderr
4Sep 9, 2026 13:392,55529,585,96020,955,000024,576stderr
5Sep 9, 2026 13:392,56529,585,72021,039,000024,576stderr
6Sep 9, 2026 13:392,62430,107,83821,519,000024,576stderr
7Sep 9, 2026 13:392,62430,020,30721,524,000024,576stderr
8Sep 9, 2026 13:392,62630,794,89921,540,000024,576stderr
9Sep 9, 2026 13:392,63930,188,62121,644,000024,576stderr