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 00:17highload-churnerhighload-churnerScore: 2,500Success
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 00:182,49429,489,40920,452,000020,480
2Oct 15, 2026 00:182,49629,434,42520,468,000020,480
3Oct 15, 2026 00:182,49729,502,04920,480,000020,480
4Oct 15, 2026 00:182,49929,534,26420,499,000020,480
5Oct 15, 2026 00:182,50029,524,96620,500,000020,480
6Oct 15, 2026 00:182,50329,515,01520,531,000020,480
7Oct 15, 2026 00:182,50529,612,70620,544,000020,480
8Oct 15, 2026 00:182,53629,812,96619,766,0001,033,00020,480
9Oct 15, 2026 00:185,83256,880,30844,617,0003,209,00020,480