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 27, 2026 16:25Victor MerckléVictor MerckléScore: 3,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 16:293,21335,643,76324,215,0002,135,0002,134,016
2Jun 27, 2026 16:293,21635,707,86424,260,0002,116,0002,129,920
3Jun 27, 2026 16:293,24635,964,17125,484,0001,134,0002,129,920
4Jun 27, 2026 16:293,31336,455,15926,030,0001,140,0002,174,976
5Jun 27, 2026 16:293,89541,203,04929,804,0002,141,0002,129,920
6Jun 27, 2026 16:2912,103108,461,18096,843,0002,405,0002,129,920
7Jun 27, 2026 16:2912,108108,440,52196,937,0002,353,0002,129,920
8Jun 27, 2026 16:2912,134108,747,14697,125,0002,381,0002,134,016
9Jun 27, 2026 16:2912,210109,341,52697,856,0002,266,0002,129,920