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:11Victor MerckléVictor MerckléScore: 2,979Success
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:122,94532,071,05123,016,0001,134,0002,117,632stderr
2Jul 9, 2026 18:122,95132,376,42723,146,0001,060,0002,117,632stderr
3Jul 9, 2026 18:122,95932,239,41923,249,0001,019,0002,117,632stderr
4Jul 9, 2026 18:122,97032,483,88923,328,0001,034,0002,117,632stderr
5Jul 9, 2026 18:122,97932,245,05323,315,0001,120,0002,117,632stderr
6Jul 9, 2026 18:123,01832,727,58423,739,0001,015,0002,117,632stderr
7Jul 9, 2026 18:123,02132,687,00123,755,0001,020,0002,117,632stderr
8Jul 9, 2026 18:123,03832,824,01723,796,0001,120,0002,117,632stderr
9Jul 9, 2026 18:1211,911105,640,62996,537,0001,137,0002,117,632stderr