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 listJun 23, 2026 21:09Victor MerckléVictor MerckléScore: 11,944Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 21:103,02632,516,01023,708,0001,109,0002,113,536
2Jun 23, 2026 21:103,07332,857,20024,092,0001,112,0002,113,536
3Jun 23, 2026 21:103,10233,222,17124,206,0001,233,0002,113,536
4Jun 23, 2026 21:103,12733,648,51024,427,0001,219,0002,113,536
5Jun 23, 2026 21:1011,944105,633,47896,937,0001,008,0002,113,536
6Jun 23, 2026 21:1012,024106,201,95697,591,0001,008,0002,113,536
7Jun 23, 2026 21:1012,031106,253,82997,647,0001,010,0002,113,536
8Jun 23, 2026 21:1012,094106,829,31098,161,0001,013,0002,113,536
9Jun 23, 2026 21:1012,133107,158,52298,484,0001,009,0002,113,536