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 9, 2026 21:22highload-churnerhighload-churnerScore: 3,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:443,61038,666,53028,549,0001,058,00024,576
2Oct 9, 2026 21:443,73139,638,74329,569,0001,031,00024,576
3Oct 9, 2026 21:443,73839,639,51929,593,0001,059,00024,576
4Oct 9, 2026 21:443,75039,777,80429,726,0001,032,00024,576
5Oct 9, 2026 21:443,75639,836,08029,735,0001,067,00024,576
6Oct 9, 2026 21:443,80340,246,90030,161,0001,031,00024,576
7Oct 9, 2026 21:443,82841,772,15830,367,0001,030,00024,576
8Oct 9, 2026 21:443,83940,524,62329,446,0002,034,00024,576
9Oct 9, 2026 21:443,88040,876,24030,791,0001,033,00024,576