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 09:32Victor MerckléVictor MerckléScore: 2,597Success
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 09:382,58729,428,83421,217,000024,576stderr
2Sep 8, 2026 09:382,59330,427,52921,265,000024,576stderr
3Sep 8, 2026 09:382,59529,628,28321,285,000024,576stderr
4Sep 8, 2026 09:382,59629,582,23321,290,000024,576stderr
5Sep 8, 2026 09:382,59729,681,54121,299,000024,576stderr
6Sep 8, 2026 09:382,59829,561,29121,309,000024,576stderr
7Sep 8, 2026 09:382,60430,538,07721,360,000024,576stderr
8Sep 8, 2026 09:385,31751,984,58642,584,0001,016,00024,576stderr
9Sep 8, 2026 09:385,32952,061,45542,688,0001,014,00024,576stderr