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 03:05highload-churnerhighload-churnerScore: 2,495Success
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 03:062,49029,406,87920,422,000020,480
2Oct 15, 2026 03:062,49329,519,18420,446,000020,480
3Oct 15, 2026 03:062,49429,517,94720,451,000020,480
4Oct 15, 2026 03:062,49429,462,42220,458,000020,480
5Oct 15, 2026 03:062,49529,492,06820,465,000020,480
6Oct 15, 2026 03:062,50029,465,28020,506,000020,480
7Oct 15, 2026 03:062,50529,581,47620,547,000020,480
8Oct 15, 2026 03:065,81556,757,39444,452,0003,237,00020,480
9Oct 15, 2026 03:065,89157,293,10544,928,0003,385,00020,480