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 07:09Victor MerckléVictor MerckléScore: 2,595Success
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 07:102,58529,635,67921,199,000024,576stderr
2Sep 8, 2026 07:102,58830,343,28021,222,000024,576stderr
3Sep 8, 2026 07:102,59129,615,34021,248,000024,576stderr
4Sep 8, 2026 07:102,59329,549,25121,264,000024,576stderr
5Sep 8, 2026 07:102,59529,761,32021,279,000024,576stderr
6Sep 8, 2026 07:102,59629,671,05521,289,000024,576stderr
7Sep 8, 2026 07:102,59630,375,82421,295,000024,576stderr
8Sep 8, 2026 07:102,59930,472,61521,313,000024,576stderr
9Sep 8, 2026 07:102,60129,538,09621,331,000024,576stderr