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:39highload-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 01:402,49329,451,32120,444,000020,480
2Oct 15, 2026 01:402,49429,441,99220,453,000020,480
3Oct 15, 2026 01:402,49629,694,38920,475,000020,480
4Oct 15, 2026 01:402,49829,423,81720,486,000020,480
5Oct 15, 2026 01:402,50029,456,54420,508,000020,480
6Oct 15, 2026 01:402,51529,673,55720,626,000020,480
7Oct 15, 2026 01:403,45637,385,78425,042,0003,304,00020,480
8Oct 15, 2026 01:404,76648,244,01035,990,0003,093,00020,480
9Oct 15, 2026 01:405,88557,290,41944,759,0003,500,00020,480