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:41highload-churnerhighload-churnerScore: 2,510Success
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:422,49129,419,01720,429,000020,480
2Oct 15, 2026 02:422,49629,483,87720,475,000020,480
3Oct 15, 2026 02:422,49629,522,12520,473,000020,480
4Oct 15, 2026 02:422,50029,524,04320,507,000020,480
5Oct 15, 2026 02:422,51029,546,05320,582,000020,480
6Oct 15, 2026 02:422,54729,807,07120,890,000020,480
7Oct 15, 2026 02:425,89557,348,01844,904,0003,435,00020,480
8Oct 15, 2026 02:425,90657,446,64045,393,0003,038,00020,480
9Oct 15, 2026 02:425,91757,534,28344,995,0003,528,00020,480