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 listJul 2, 2026 14:27Victor MerckléVictor MerckléScore: 12,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:283,14033,592,54824,739,0001,013,0002,117,632stderr
2Jul 2, 2026 14:2812,161107,611,55298,605,0001,121,0002,117,632stderr
3Jul 2, 2026 14:2812,167107,634,39498,644,0001,126,0002,117,632stderr
4Jul 2, 2026 14:2812,202108,017,70598,912,0001,152,0002,117,632stderr
5Jul 2, 2026 14:2812,206108,183,37698,956,0001,138,0002,117,632stderr
6Jul 2, 2026 14:2812,226108,131,50199,220,0001,035,0002,117,632stderr
7Jul 2, 2026 14:2812,236108,302,27699,201,0001,138,0002,117,632stderr
8Jul 2, 2026 14:2812,241108,241,38999,244,0001,133,0002,117,632stderr
9Jul 2, 2026 14:2812,261108,469,36799,488,0001,060,0002,117,632stderr