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 listOct 13, 2026 05:25highload-churnerhighload-churnerScore: 2,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 05:262,59630,446,09121,292,000020,480
2Oct 13, 2026 05:262,59730,253,52921,299,000020,480
3Oct 13, 2026 05:262,60030,236,60721,322,000020,480
4Oct 13, 2026 05:262,60030,240,28721,326,000020,480
5Oct 13, 2026 05:262,60130,352,44721,336,000020,480
6Oct 13, 2026 05:262,60530,385,41421,369,000020,480
7Oct 13, 2026 05:262,60530,532,64621,364,000020,480
8Oct 13, 2026 05:262,60630,382,93121,371,000020,480
9Oct 13, 2026 05:2627,020230,490,776221,566,000020,480