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 12, 2026 11:51Victor MerckléVictor MerckléScore: 3,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 11:553,47937,530,63525,985,0002,546,0002,129,920
2Jun 12, 2026 11:553,51337,830,28926,341,0002,466,0002,129,920
3Jun 12, 2026 11:553,51737,758,62826,703,0002,143,0002,129,920
4Jun 12, 2026 11:553,56838,218,12726,137,0003,126,0002,174,976
5Jun 12, 2026 11:553,56938,345,52126,785,0002,485,0002,129,920
6Jun 12, 2026 11:553,57538,332,55427,080,0002,241,0002,129,920
7Jun 12, 2026 11:553,62838,786,06627,539,0002,215,0002,134,016
8Jun 12, 2026 11:556,68863,879,12052,692,0002,153,0002,129,920
9Jun 12, 2026 11:5512,913114,838,244102,740,0003,151,0002,134,016