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 11:48highload-churnerhighload-churnerScore: 2,865Success
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 11:482,85832,385,10020,142,0003,299,00028,672stderr
2Oct 13, 2026 11:482,85932,485,44220,252,0003,199,00028,672stderr
3Oct 13, 2026 11:482,86032,486,41520,241,0003,216,00028,672stderr
4Oct 13, 2026 11:482,86132,402,00020,111,0003,355,00028,672stderr
5Oct 13, 2026 11:482,86532,483,30220,071,0003,426,00028,672stderr
6Oct 13, 2026 11:482,86632,478,94620,239,0003,263,00028,672stderr
7Oct 13, 2026 11:482,87232,495,12520,123,0003,435,00028,672stderr
8Oct 13, 2026 11:482,87632,576,71520,373,0003,214,00028,672stderr
9Oct 13, 2026 11:4839,264331,041,557318,773,0003,199,00028,672stderr