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 14:49Victor MerckléVictor MerckléScore: 2,563Success
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 14:502,55429,291,51120,945,000024,576stderr
2Sep 8, 2026 14:502,55829,164,03420,983,000024,576stderr
3Sep 8, 2026 14:502,55929,418,85620,990,000024,576stderr
4Sep 8, 2026 14:502,56129,257,02721,006,000024,576stderr
5Sep 8, 2026 14:502,56329,282,86621,024,000024,576stderr
6Sep 8, 2026 14:502,56829,318,97621,061,000024,576stderr
7Sep 8, 2026 14:502,65530,141,90621,771,000024,576stderr
8Sep 8, 2026 14:502,65930,130,02221,810,000024,576stderr
9Sep 8, 2026 14:505,39452,593,51643,223,0001,013,00024,576stderr