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 16:09Victor MerckléVictor MerckléScore: 2,643Success
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 16:102,56429,284,18121,032,000024,576stderr
2Sep 8, 2026 16:102,57229,299,38821,095,000024,576stderr
3Sep 8, 2026 16:102,62130,018,63221,494,000024,576stderr
4Sep 8, 2026 16:102,63229,949,84921,587,000024,576stderr
5Sep 8, 2026 16:102,64330,777,96521,679,000024,576stderr
6Sep 8, 2026 16:102,64730,805,59121,711,000024,576stderr
7Sep 8, 2026 16:102,64929,998,24821,726,000024,576stderr
8Sep 8, 2026 16:102,65030,813,90321,731,000024,576stderr
9Sep 8, 2026 16:105,47853,409,11643,910,0001,014,00024,576stderr