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 8, 2026 12:38Victor MerckléVictor MerckléScore: 3,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:392,88831,527,02922,662,0001,026,0002,117,632stderr
2Jul 8, 2026 12:392,90931,848,39422,762,0001,099,0002,117,632stderr
3Jul 8, 2026 12:392,92631,926,68122,973,0001,026,0002,117,632stderr
4Jul 8, 2026 12:392,94432,167,73722,944,0001,201,0002,117,632stderr
5Jul 8, 2026 12:393,05532,977,63923,840,0001,212,0002,117,632stderr
6Jul 8, 2026 12:3911,713103,868,07294,924,0001,123,0002,117,632stderr
7Jul 8, 2026 12:3911,716103,920,47794,937,0001,139,0002,117,632stderr
8Jul 8, 2026 12:3911,781104,504,98895,569,0001,037,0002,117,632stderr
9Jul 8, 2026 12:3912,493110,332,212101,445,0001,005,0002,117,632stderr