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 10:43Victor MerckléVictor MerckléScore: 2,779Success
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 10:452,77131,080,74622,724,000024,576stderr
2Sep 8, 2026 10:452,77531,082,93722,757,000024,576stderr
3Sep 8, 2026 10:452,77631,888,10822,767,000024,576stderr
4Sep 8, 2026 10:452,77832,356,29822,782,000024,576stderr
5Sep 8, 2026 10:452,77931,934,53922,794,000024,576stderr
6Sep 8, 2026 10:452,78631,105,18922,847,000024,576stderr
7Sep 8, 2026 10:452,79631,266,50922,928,000024,576stderr
8Sep 8, 2026 10:452,79632,027,27622,929,000024,576stderr
9Sep 8, 2026 10:452,82340,415,40123,151,000024,576stderr