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 17:36highload-churnerhighload-churnerScore: 6,404Success
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 17:426,32760,835,82149,858,0002,026,00024,576
2Oct 9, 2026 17:426,35361,096,82951,080,0001,017,00024,576
3Oct 9, 2026 17:426,36261,101,98851,141,0001,033,00024,576
4Oct 9, 2026 17:426,40061,400,45151,468,0001,019,00024,576
5Oct 9, 2026 17:426,40461,738,29151,490,0001,023,00024,576
6Oct 9, 2026 17:426,44261,762,65551,812,0001,019,00024,576
7Oct 9, 2026 17:426,44561,849,38951,809,0001,040,00024,576
8Oct 9, 2026 17:426,46661,990,71752,007,0001,017,00020,480
9Oct 9, 2026 17:426,47562,063,27852,077,0001,019,00024,576