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 23:28Victor MerckléVictor MerckléScore: 11,971Success
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 23:292,99332,015,97923,384,0001,162,0002,113,536
2Jun 23, 2026 23:293,03632,550,75323,669,0001,231,0002,113,536
3Jun 23, 2026 23:293,07832,846,86624,025,0001,221,0002,113,536
4Jun 23, 2026 23:293,10833,070,00524,280,0001,210,0002,113,536
5Jun 23, 2026 23:2911,971105,955,92097,153,0001,012,0002,113,536
6Jun 23, 2026 23:2912,018106,163,25697,539,0001,010,0002,113,536
7Jun 23, 2026 23:2912,088106,773,33398,119,0001,009,0002,113,536
8Jun 23, 2026 23:2912,152107,274,75698,637,0001,012,0002,113,536
9Jun 23, 2026 23:2912,656111,401,797102,775,0001,009,0002,113,536