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 listJun 29, 2026 14:37Victor MerckléVictor MerckléScore: 3,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:383,03532,895,27723,699,0001,196,0002,125,824stderr
2Jun 29, 2026 14:383,07033,354,35824,019,0001,160,0002,125,824stderr
3Jun 29, 2026 14:383,08133,137,85024,091,0001,174,0002,125,824stderr
4Jun 29, 2026 14:383,09833,241,88324,237,0001,167,0002,125,824stderr
5Jun 29, 2026 14:383,10233,347,74524,275,0001,163,0002,125,824stderr
6Jun 29, 2026 14:3812,020106,703,06797,555,0001,009,0002,125,824stderr
7Jun 29, 2026 14:3812,030107,009,32997,643,0001,008,0002,125,824stderr
8Jun 29, 2026 14:3812,030106,643,05097,643,0001,009,0002,125,824stderr
9Jun 29, 2026 14:3812,130107,360,52398,458,0001,008,0002,125,824stderr