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:44Victor MerckléVictor MerckléScore: 2,903Success
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:452,88931,953,48323,696,000024,576stderr
2Sep 8, 2026 08:452,88931,964,45023,694,000024,576stderr
3Sep 8, 2026 08:452,89433,347,63523,735,000024,576stderr
4Sep 8, 2026 08:452,89732,049,26323,756,000024,576stderr
5Sep 8, 2026 08:452,90332,889,40523,808,000024,576stderr
6Sep 8, 2026 08:452,90632,236,02623,835,000024,576stderr
7Sep 8, 2026 08:452,90832,995,24223,846,000024,576stderr
8Sep 8, 2026 08:452,90933,006,18923,861,000024,576stderr
9Sep 8, 2026 08:455,65554,754,67445,363,0001,014,00024,576stderr