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 22:21highload-churnerhighload-churnerScore: 3,502Success
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 23:363,43637,186,84127,107,0001,074,00024,576
2Oct 9, 2026 23:363,43937,263,97227,169,0001,034,00024,576
3Oct 9, 2026 23:363,46537,276,26626,388,0002,033,00024,576
4Oct 9, 2026 23:363,48037,429,68126,475,0002,063,00024,576
5Oct 9, 2026 23:363,50237,643,57127,648,0001,072,00024,576
6Oct 9, 2026 23:363,52737,848,03427,887,0001,035,00024,576
7Oct 9, 2026 23:363,53837,994,98526,920,0002,093,00024,576
8Oct 9, 2026 23:363,56138,213,80127,193,0002,015,00024,576
9Oct 9, 2026 23:363,56338,264,09928,188,0001,033,00024,576