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 12:59highload-churnerhighload-churnerScore: 2,499Success
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 13:022,49029,447,84120,421,000020,480
2Oct 13, 2026 13:022,49329,454,72020,446,000020,480
3Oct 13, 2026 13:022,49529,474,25220,463,000020,480
4Oct 13, 2026 13:022,49629,253,02120,475,000020,480
5Oct 13, 2026 13:022,49929,466,10120,499,000020,480
6Oct 13, 2026 13:022,50429,576,33020,536,000020,480
7Oct 13, 2026 13:022,50629,535,10120,553,000020,480
8Oct 13, 2026 13:0237,335315,132,604306,155,000020,480
9Oct 13, 2026 13:0237,917319,931,862310,926,000020,480