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 15:09Victor MerckléVictor MerckléScore: 3,044Success
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 15:103,00532,561,14923,622,0001,024,0002,117,632stderr
2Jul 2, 2026 15:103,02132,753,00423,716,0001,062,0002,117,632stderr
3Jul 2, 2026 15:103,02432,663,61423,786,0001,014,0002,117,632stderr
4Jul 2, 2026 15:103,03432,775,70423,868,0001,018,0002,117,632stderr
5Jul 2, 2026 15:103,04432,808,31823,946,0001,022,0002,117,632stderr
6Jul 2, 2026 15:103,08833,257,04024,161,0001,165,0002,117,632stderr
7Jul 2, 2026 15:1011,836104,928,10695,939,0001,118,0002,117,632stderr
8Jul 2, 2026 15:1011,889105,431,40096,449,0001,041,0002,117,632stderr
9Jul 2, 2026 15:1012,039106,657,00797,598,0001,123,0002,117,632stderr