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 08:40Victor MerckléVictor MerckléScore: 2,615Success
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 08:412,59229,682,05121,258,000024,576stderr
2Sep 8, 2026 08:412,59229,654,77421,260,000024,576stderr
3Sep 8, 2026 08:412,59531,699,19021,282,000024,576stderr
4Sep 8, 2026 08:412,59629,529,16321,294,000024,576stderr
5Sep 8, 2026 08:412,61530,672,77321,450,000024,576stderr
6Sep 8, 2026 08:415,33152,053,09942,704,0001,014,00024,576stderr
7Sep 8, 2026 08:415,33351,943,08742,722,0001,014,00024,576stderr
8Sep 8, 2026 08:415,33752,169,93342,755,0001,013,00024,576stderr
9Sep 8, 2026 08:415,35553,016,14842,901,0001,015,00024,576stderr