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 listSep 1, 2026 12:24Victor MerckléVictor MerckléScore: 5,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 12:252,72630,773,17721,340,0001,015,0002,117,632stderr
2Sep 1, 2026 12:252,72830,712,20221,358,0001,013,0002,117,632stderr
3Sep 1, 2026 12:252,73130,761,04221,337,0001,061,0002,117,632stderr
4Sep 1, 2026 12:255,39552,702,96443,231,0001,013,0002,117,632stderr
5Sep 1, 2026 12:255,39652,601,79543,236,0001,013,0002,117,632stderr
6Sep 1, 2026 12:255,41252,812,29443,368,0001,015,0002,117,632stderr
7Sep 1, 2026 12:255,42553,425,81043,473,0001,016,0002,117,632stderr
8Sep 1, 2026 12:255,43153,578,49143,520,0001,016,0002,117,632stderr
9Sep 1, 2026 12:2514,486128,425,454117,776,0001,013,0002,117,632stderr