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 09:24highload-churnerhighload-churnerScore: 2,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 09:252,51229,543,66320,599,000020,480
2Oct 13, 2026 09:252,51629,611,32720,633,000020,480
3Oct 13, 2026 09:252,51629,582,55720,633,000020,480
4Oct 13, 2026 09:252,51729,576,02620,645,000020,480
5Oct 13, 2026 09:252,51929,636,31120,659,000020,480
6Oct 13, 2026 09:252,52029,685,03520,668,000020,480
7Oct 13, 2026 09:252,52429,661,48520,700,000020,480
8Oct 13, 2026 09:252,52529,668,43320,706,000020,480
9Oct 13, 2026 09:252,53129,696,02320,760,000020,480