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 23:50highload-churnerhighload-churnerScore: 3,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:313,29635,971,73625,998,0001,032,00024,576
2Oct 10, 2026 01:313,30736,113,72326,090,0001,033,00024,576
3Oct 10, 2026 01:313,31836,224,25725,116,0002,094,00024,576
4Oct 10, 2026 01:313,35936,495,08926,511,0001,034,00024,576
5Oct 10, 2026 01:313,37838,416,71726,670,0001,031,00024,576
6Oct 10, 2026 01:313,38336,814,26026,715,0001,033,00024,576
7Oct 10, 2026 01:313,44637,296,23427,232,0001,032,00024,576
8Oct 10, 2026 01:313,47137,460,69127,438,0001,031,00024,576
9Oct 10, 2026 01:3127,185232,016,397221,915,0001,005,00024,576