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 01:33highload-churnerhighload-churnerScore: 2,495Success
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 01:342,48830,735,41620,404,000020,480
2Oct 15, 2026 01:342,49129,483,01420,428,000020,480
3Oct 15, 2026 01:342,49229,443,05620,435,000020,480
4Oct 15, 2026 01:342,49329,479,36820,447,000020,480
5Oct 15, 2026 01:342,49529,480,92020,463,000020,480
6Oct 15, 2026 01:342,49729,486,00320,478,000020,480
7Oct 15, 2026 01:342,49829,541,08620,490,000020,480
8Oct 15, 2026 01:344,21450,346,89931,094,0003,465,00020,480
9Oct 15, 2026 01:345,80456,606,90944,384,0003,216,00020,480