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:04Victor MerckléVictor MerckléScore: 3,122Success
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:053,06232,999,33124,050,0001,063,0002,117,632stderr
2Jul 2, 2026 01:053,07533,165,12024,160,0001,062,0002,117,632stderr
3Jul 2, 2026 01:053,09633,293,78024,354,0001,041,0002,117,632stderr
4Jul 2, 2026 01:053,10933,416,72024,457,0001,044,0002,117,632stderr
5Jul 2, 2026 01:053,12233,491,89624,572,0001,035,0002,117,632stderr
6Jul 2, 2026 01:053,14033,650,23224,699,0001,053,0002,117,632stderr
7Jul 2, 2026 01:053,18734,026,41925,103,0001,034,0002,117,632stderr
8Jul 2, 2026 01:0512,078106,884,00496,966,0002,075,0002,117,632stderr
9Jul 2, 2026 01:0512,142107,446,79197,374,0002,191,0002,117,632stderr