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 12:40Victor MerckléVictor MerckléScore: 2,583Success
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 12:412,55429,329,00120,950,000024,576stderr
2Sep 8, 2026 12:412,55529,340,69420,956,000024,576stderr
3Sep 8, 2026 12:412,56029,360,37320,998,000024,576stderr
4Sep 8, 2026 12:412,56329,468,61421,023,000024,576stderr
5Sep 8, 2026 12:412,58329,577,87721,186,000024,576stderr
6Sep 8, 2026 12:412,67230,224,47020,896,0001,021,00024,576stderr
7Sep 8, 2026 12:415,38852,663,98943,172,0001,014,00024,576stderr
8Sep 8, 2026 12:415,45553,826,38243,719,0001,015,00024,576stderr
9Sep 8, 2026 12:415,46753,112,51443,820,0001,014,00024,576stderr