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 03:18Victor MerckléVictor MerckléScore: 12,006Success
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 03:193,19934,410,85325,047,0001,192,0002,117,632stderr
2Jul 8, 2026 03:193,21134,998,50425,153,0001,182,0002,117,632stderr
3Jul 8, 2026 03:193,21834,485,95825,187,0001,205,0002,117,632stderr
4Jul 8, 2026 03:193,26734,923,19725,585,0001,210,0002,117,632stderr
5Jul 8, 2026 03:1912,006106,614,74297,445,0001,009,0002,117,632stderr
6Jul 8, 2026 03:1912,115107,447,83398,337,0001,010,0002,117,632stderr
7Jul 8, 2026 03:1912,133107,675,94998,480,0001,011,0002,117,632stderr
8Jul 8, 2026 03:1912,155107,789,57598,663,0001,009,0002,117,632stderr
9Jul 8, 2026 03:1912,750114,634,630103,546,0001,010,0002,117,632stderr