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 05:50highload-churnerhighload-churnerScore: 2,546Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
Oct 13, 2026 12:08Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 05:512,54229,804,95220,846,000020,480
2Oct 13, 2026 05:512,54229,863,34120,848,000020,480
3Oct 13, 2026 05:512,54429,771,56020,866,000020,480
4Oct 13, 2026 05:512,54429,822,14120,868,000020,480
5Oct 13, 2026 05:512,54629,878,37420,885,000020,480
6Oct 13, 2026 05:512,54829,911,15420,894,000020,480
7Oct 13, 2026 05:512,54829,848,76120,900,000020,480
8Oct 13, 2026 05:512,54829,954,58320,894,000020,480
9Oct 13, 2026 05:512,55529,920,78820,957,000020,480