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 13, 2026 00:35highload-churnerhighload-churnerScore: 2,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 00:362,74731,508,94321,491,0001,035,0002,113,536
2Oct 13, 2026 00:362,75131,497,78921,464,0001,098,0002,113,536
3Oct 13, 2026 00:362,75233,473,35921,452,0001,119,0002,113,536
4Oct 13, 2026 00:362,75231,514,48821,454,0001,113,0002,113,536
5Oct 13, 2026 00:362,75331,573,62621,475,0001,100,0002,113,536
6Oct 13, 2026 00:362,75631,611,06321,456,0001,146,0002,113,536
7Oct 13, 2026 00:362,76231,608,76321,540,0001,116,0002,113,536
8Oct 13, 2026 00:362,76331,592,67621,534,0001,130,0002,113,536
9Oct 13, 2026 00:3629,813253,450,033243,454,0001,015,0002,113,536