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 15, 2026 00:19highload-churnerhighload-churnerScore: 2,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 00:192,49529,517,55020,459,000020,480
2Oct 15, 2026 00:192,49629,505,53720,470,000020,480
3Oct 15, 2026 00:192,49729,516,09220,479,000020,480
4Oct 15, 2026 00:192,49729,494,54820,478,000020,480
5Oct 15, 2026 00:192,50029,498,84920,507,000020,480
6Oct 15, 2026 00:192,50529,617,13420,542,000020,480
7Oct 15, 2026 00:194,17943,307,81330,848,0003,422,00020,480
8Oct 15, 2026 00:195,84056,876,78844,670,0003,223,00020,480
9Oct 15, 2026 00:195,87857,213,22544,784,0003,422,00020,480