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 00:44Victor MerckléVictor MerckléScore: 3,110Success
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 00:453,04132,864,92523,762,0001,178,0002,117,632stderr
2Jul 2, 2026 00:453,05132,833,59823,948,0001,074,0002,117,632stderr
3Jul 2, 2026 00:453,07433,156,03824,062,0001,151,0002,117,632stderr
4Jul 2, 2026 00:453,10933,431,10024,336,0001,162,0002,117,632stderr
5Jul 2, 2026 00:453,11034,681,84524,331,0001,171,0002,117,632stderr
6Jul 2, 2026 00:453,13033,535,98324,577,0001,096,0002,117,632stderr
7Jul 2, 2026 00:453,32135,114,57426,210,0001,027,0002,117,632stderr
8Jul 2, 2026 00:4512,026106,513,45097,610,0001,007,0002,117,632stderr
9Jul 2, 2026 00:4512,687111,976,815103,028,0001,008,0002,117,632stderr