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 01:13highload-churnerhighload-churnerScore: 2,494Success
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 01:142,48729,394,89320,395,000020,480
2Oct 15, 2026 01:142,49229,446,50420,441,000020,480
3Oct 15, 2026 01:142,49329,473,96220,443,000020,480
4Oct 15, 2026 01:142,49329,516,54520,444,000020,480
5Oct 15, 2026 01:142,49429,415,99920,458,000020,480
6Oct 15, 2026 01:142,49530,897,75320,459,000020,480
7Oct 15, 2026 01:142,49729,500,53920,476,000020,480
8Oct 15, 2026 01:142,49729,424,16120,477,000020,480
9Oct 15, 2026 01:142,49929,535,41120,494,000020,480