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 19:57Victor MerckléVictor MerckléScore: 2,630Success
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 19:582,56629,516,85521,043,000024,576stderr
2Sep 8, 2026 19:582,56729,527,45320,043,0001,013,00024,576stderr
3Sep 8, 2026 19:582,56829,601,82921,059,000024,576stderr
4Sep 8, 2026 19:582,58329,626,34221,188,000024,576stderr
5Sep 8, 2026 19:582,63030,013,24021,567,000024,576stderr
6Sep 8, 2026 19:582,63230,123,44221,589,000024,576stderr
7Sep 8, 2026 19:582,64030,747,52721,656,000024,576stderr
8Sep 8, 2026 19:582,68130,415,65221,989,000024,576stderr
9Sep 8, 2026 19:585,44653,189,12143,647,0001,016,00024,576stderr