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 4, 2026 05:13Victor MerckléVictor MerckléScore: 3,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:143,12533,546,41424,505,0001,124,0002,117,632stderr
2Jul 4, 2026 05:143,13933,620,27824,707,0001,036,0002,117,632stderr
3Jul 4, 2026 05:143,15934,003,54924,875,0001,031,0002,117,632stderr
4Jul 4, 2026 05:143,17536,017,11624,965,0001,078,0002,117,632stderr
5Jul 4, 2026 05:143,23034,310,01825,381,0001,108,0002,117,632stderr
6Jul 4, 2026 05:1411,889105,366,03596,367,0001,124,0002,117,632stderr
7Jul 4, 2026 05:1411,946105,945,78096,830,0001,135,0002,117,632stderr
8Jul 4, 2026 05:1411,954105,885,79696,882,0001,142,0002,117,632stderr
9Jul 4, 2026 05:1412,590111,567,302102,082,0001,162,0002,117,632stderr