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 8, 2026 02:34Victor MerckléVictor MerckléScore: 3,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 02:363,06933,505,76624,115,0001,053,0002,142,208stderr
2Jul 8, 2026 02:363,06933,552,73024,119,0001,048,0002,142,208stderr
3Jul 8, 2026 02:363,08033,510,26424,204,0001,060,0002,142,208stderr
4Jul 8, 2026 02:363,08833,353,94624,274,0001,052,0002,142,208stderr
5Jul 8, 2026 02:363,08833,602,42724,270,0001,055,0002,142,208stderr
6Jul 8, 2026 02:363,10333,660,33423,313,0002,137,0002,142,208stderr
7Jul 8, 2026 02:3612,512110,993,274100,428,0002,176,0002,142,208stderr
8Jul 8, 2026 02:3612,592111,436,780101,010,0002,249,0002,142,208stderr
9Jul 8, 2026 02:3612,775113,532,750102,575,0002,181,0002,142,208stderr