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 2, 2026 15:04Victor MerckléVictor MerckléScore: 14,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 15:055,86956,021,60247,079,0001,053,0002,117,632stderr
2Jul 2, 2026 15:056,00357,131,46948,185,0001,047,0002,117,632stderr
3Jul 2, 2026 15:056,17058,834,29149,580,0001,015,0002,117,632stderr
4Jul 2, 2026 15:0514,749128,847,581119,768,0001,177,0002,117,632stderr
5Jul 2, 2026 15:0514,863129,765,440120,695,0001,187,0002,117,632stderr
6Jul 2, 2026 15:0514,865129,717,061120,704,0001,197,0002,117,632stderr
7Jul 2, 2026 15:0514,870129,852,102120,767,0001,167,0002,117,632stderr
8Jul 2, 2026 15:0514,935130,339,673121,292,0001,183,0002,117,632stderr
9Jul 2, 2026 15:0515,759137,054,512128,218,0001,006,0002,117,632stderr