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 9, 2026 18:23Victor MerckléVictor MerckléScore: 2,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 18:242,90031,828,56722,643,0001,144,0002,117,632stderr
2Jul 9, 2026 18:242,90231,777,94322,738,0001,061,0002,117,632stderr
3Jul 9, 2026 18:242,90931,993,17422,741,0001,120,0002,117,632stderr
4Jul 9, 2026 18:242,91236,121,73922,826,0001,058,0002,117,632stderr
5Jul 9, 2026 18:242,92932,021,98222,910,0001,113,0002,117,632stderr
6Jul 9, 2026 18:242,99333,039,19723,477,0001,069,0002,117,632stderr
7Jul 9, 2026 18:2411,770104,512,72995,454,0001,068,0002,117,632stderr
8Jul 9, 2026 18:2411,796104,901,50695,541,0001,191,0002,117,632stderr
9Jul 9, 2026 18:2411,849105,221,54195,984,0001,179,0002,117,632stderr