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 15, 2026 02:50highload-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 15, 2026 02:512,49129,401,82620,433,000020,480
2Oct 15, 2026 02:512,49329,490,78120,449,000020,480
3Oct 15, 2026 02:512,49629,515,20720,468,000020,480
4Oct 15, 2026 02:512,49629,413,10820,470,000020,480
5Oct 15, 2026 02:512,49929,495,54620,497,000020,480
6Oct 15, 2026 02:512,50029,488,57920,505,000020,480
7Oct 15, 2026 02:512,50029,579,47920,502,000020,480
8Oct 15, 2026 02:513,64138,906,02726,500,0003,360,00020,480
9Oct 15, 2026 02:515,87157,116,49044,780,0003,365,00020,480