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:48highload-churnerhighload-churnerScore: 2,502Success
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:492,48929,473,85620,415,000020,480
2Oct 13, 2026 14:492,49429,425,46020,457,000020,480
3Oct 13, 2026 14:492,49829,486,13920,491,000020,480
4Oct 13, 2026 14:492,50029,508,39820,506,000020,480
5Oct 13, 2026 14:492,50229,602,78120,524,000020,480
6Oct 13, 2026 14:492,50529,641,26920,549,000020,480
7Oct 13, 2026 14:493,63838,749,75226,426,0003,412,00020,480
8Oct 13, 2026 14:495,78956,504,71944,395,0003,082,00020,480
9Oct 13, 2026 14:495,90557,456,41744,930,0003,492,00020,480