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:18highload-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 01:192,49229,393,29920,440,000020,480
2Oct 15, 2026 01:192,49429,415,01820,458,000020,480
3Oct 15, 2026 01:192,49429,388,51720,457,000020,480
4Oct 15, 2026 01:192,49529,482,91420,462,000020,480
5Oct 15, 2026 01:192,49529,462,80820,465,000020,480
6Oct 15, 2026 01:192,49529,441,98320,465,000020,480
7Oct 15, 2026 01:193,66039,121,73626,449,0003,571,00020,480
8Oct 15, 2026 01:194,79748,301,62035,964,0003,374,00020,480
9Oct 15, 2026 01:195,95658,794,30045,471,0003,371,00020,480