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 01:12Victor MerckléVictor MerckléScore: 12,570Success
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 01:133,03633,138,72123,740,0001,159,0002,117,632stderr
2Jul 2, 2026 01:1311,954105,905,62097,020,0001,007,0002,117,632stderr
3Jul 2, 2026 01:1312,550110,979,581101,903,0001,007,0002,117,632stderr
4Jul 2, 2026 01:1312,568110,987,084102,056,0001,006,0002,117,632stderr
5Jul 2, 2026 01:1312,570110,986,458102,067,0001,007,0002,117,632stderr
6Jul 2, 2026 01:1312,613111,368,224102,423,0001,007,0002,117,632stderr
7Jul 2, 2026 01:1312,616111,330,754102,452,0001,006,0002,117,632stderr
8Jul 2, 2026 01:1312,623111,406,300102,504,0001,007,0002,117,632stderr
9Jul 2, 2026 01:1312,670111,816,249102,891,0001,010,0002,117,632stderr