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:16highload-churnerhighload-churnerScore: 3,489Success
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:203,39537,798,10126,771,0001,069,00024,576
2Oct 9, 2026 21:203,43937,371,75327,165,0001,035,00024,576
3Oct 9, 2026 21:203,46437,370,00327,375,0001,036,00024,576
4Oct 9, 2026 21:203,48537,507,53527,508,0001,072,00024,576
5Oct 9, 2026 21:203,48937,627,01227,578,0001,035,00024,576
6Oct 9, 2026 21:203,52237,920,16127,845,0001,036,00024,576
7Oct 9, 2026 21:203,55338,123,30928,104,0001,034,00024,576
8Oct 9, 2026 21:203,62738,817,00928,713,0001,035,00024,576
9Oct 9, 2026 21:2027,950238,194,382228,191,0001,006,00024,576