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 7, 2026 17:20Victor MerckléVictor MerckléScore: 2,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:202,58429,695,90621,192,000024,576stderr
2Sep 7, 2026 17:202,58629,707,72421,213,000024,576stderr
3Sep 7, 2026 17:202,58929,460,05721,235,000024,576stderr
4Sep 7, 2026 17:202,59529,802,08321,280,000024,576stderr
5Sep 7, 2026 17:202,60131,839,78721,331,000024,576stderr
6Sep 7, 2026 17:202,60630,589,38520,371,0001,004,00024,576stderr
7Sep 7, 2026 17:205,27251,815,72142,225,0001,011,00024,576stderr
8Sep 7, 2026 17:205,27652,440,21942,250,0001,018,00024,576stderr
9Sep 7, 2026 17:205,28251,544,47742,286,0001,028,00024,576stderr