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 05:14highload-churnerhighload-churnerScore: 2,491Success
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 05:152,48529,420,70020,378,000020,480
2Oct 15, 2026 05:152,48729,429,56620,395,000020,480
3Oct 15, 2026 05:152,49029,484,30420,419,000020,480
4Oct 15, 2026 05:152,49129,459,42020,434,000020,480
5Oct 15, 2026 05:152,49129,448,44320,434,000020,480
6Oct 15, 2026 05:152,49129,430,66020,430,000020,480
7Oct 15, 2026 05:152,50429,507,24920,538,000020,480
8Oct 15, 2026 05:153,58038,394,67326,067,0003,294,00020,480
9Oct 15, 2026 05:155,90357,367,24445,367,0003,039,00020,480