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 7, 2026 12:10Victor MerckléVictor MerckléScore: 2,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:112,86431,515,01922,450,0001,036,0002,117,632stderr
2Jul 7, 2026 12:112,87832,005,95222,577,0001,029,0002,117,632stderr
3Jul 7, 2026 12:112,89231,768,17222,684,0001,038,0002,117,632stderr
4Jul 7, 2026 12:112,90431,783,44322,799,0001,017,0002,117,632stderr
5Jul 7, 2026 12:112,91431,889,94922,884,0001,015,0002,117,632stderr
6Jul 7, 2026 12:112,92832,462,57922,984,0001,033,0002,117,632stderr
7Jul 7, 2026 12:1111,728104,659,02695,041,0001,134,0002,117,632stderr
8Jul 7, 2026 12:1111,844105,483,03695,996,0001,127,0002,117,632stderr
9Jul 7, 2026 12:1111,908106,053,65496,506,0001,142,0002,117,632stderr