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 14:26highload-churnerhighload-churnerScore: 2,499Success
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 14:272,49229,447,95720,440,000020,480
2Oct 13, 2026 14:272,49729,508,32120,477,000020,480
3Oct 13, 2026 14:272,49729,492,40620,480,000020,480
4Oct 13, 2026 14:272,49729,488,03020,479,000020,480
5Oct 13, 2026 14:272,49929,565,73920,494,000020,480
6Oct 13, 2026 14:272,50129,529,38420,514,000020,480
7Oct 13, 2026 14:272,51529,643,06520,629,000020,480
8Oct 13, 2026 14:273,60238,369,28626,271,0003,268,00020,480
9Oct 13, 2026 14:274,78048,265,51136,035,0003,166,00020,480