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 5, 2026 04:24Victor MerckléVictor MerckléScore: 3,442Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 04:243,39737,004,39426,827,0001,036,0002,113,536
2Jun 5, 2026 04:243,40236,988,26026,833,0001,069,0002,113,536
3Jun 5, 2026 04:243,42437,085,19427,045,0001,037,0002,113,536
4Jun 5, 2026 04:243,42937,217,29026,063,0002,058,0002,113,536
5Jun 5, 2026 04:243,44237,409,73527,192,0001,036,0002,113,536
6Jun 5, 2026 04:243,47137,576,65126,414,0002,051,0002,113,536
7Jun 5, 2026 04:2413,129116,833,293105,648,0002,017,0002,113,536
8Jun 5, 2026 04:2413,542126,133,119109,020,0002,032,0002,113,536
9Jun 5, 2026 04:2413,544120,127,602109,051,0002,014,0002,113,536