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 11:07Victor MerckléVictor MerckléScore: 2,864Success
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 11:102,85431,861,33823,403,000024,576stderr
2Sep 8, 2026 11:102,86031,918,74323,460,000024,576stderr
3Sep 8, 2026 11:102,86031,835,21023,455,000024,576stderr
4Sep 8, 2026 11:102,86131,945,36123,464,000024,576stderr
5Sep 8, 2026 11:102,86431,936,98323,490,000024,576stderr
6Sep 8, 2026 11:102,91032,295,27523,866,000024,576stderr
7Sep 8, 2026 11:102,91732,389,65923,926,000024,576stderr
8Sep 8, 2026 11:102,92032,630,93023,945,000024,576stderr
9Sep 8, 2026 11:105,75055,885,14946,144,0001,013,00024,576stderr