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:08Victor MerckléVictor MerckléScore: 2,947Success
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:092,88431,912,95622,617,0001,036,0002,117,632stderr
2Jul 4, 2026 05:092,88531,622,58522,617,0001,048,0002,117,632stderr
3Jul 4, 2026 05:092,88631,914,50222,643,0001,026,0002,117,632stderr
4Jul 4, 2026 05:092,93231,935,46023,027,0001,023,0002,117,632stderr
5Jul 4, 2026 05:092,94732,489,33123,093,0001,077,0002,117,632stderr
6Jul 4, 2026 05:0911,702103,869,61994,923,0001,041,0002,117,632stderr
7Jul 4, 2026 05:0911,718104,058,76994,960,0001,129,0002,117,632stderr
8Jul 4, 2026 05:0911,785104,572,05895,613,0001,029,0002,117,632stderr
9Jul 4, 2026 05:0911,874105,714,64896,201,0001,170,0002,117,632stderr