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 7, 2026 11:46Victor MerckléVictor MerckléScore: 2,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 11:462,85931,426,71622,390,0001,058,0002,117,632stderr
2Jul 7, 2026 11:462,86431,899,02722,429,0001,062,0002,117,632stderr
3Jul 7, 2026 11:462,88232,040,92322,572,0001,065,0002,117,632stderr
4Jul 7, 2026 11:462,88932,155,99922,569,0001,127,0002,117,632stderr
5Jul 7, 2026 11:462,89631,711,94422,679,0001,069,0002,117,632stderr
6Jul 7, 2026 11:462,93332,049,42422,986,0001,065,0002,117,632stderr
7Jul 7, 2026 11:4611,725104,126,90294,978,0001,174,0002,117,632stderr
8Jul 7, 2026 11:4611,745105,782,31995,098,0001,212,0002,117,632stderr
9Jul 7, 2026 11:4611,798104,694,55395,468,0001,281,0002,117,632stderr