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 04:21highload-churnerhighload-churnerScore: 2,497Success
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 04:222,48429,441,05920,369,000020,480
2Oct 15, 2026 04:222,48929,449,05520,413,000020,480
3Oct 15, 2026 04:222,49029,400,85220,423,000020,480
4Oct 15, 2026 04:222,49129,466,34720,432,000020,480
5Oct 15, 2026 04:222,49729,485,88920,480,000020,480
6Oct 15, 2026 04:223,59938,548,35126,295,0003,221,00020,480
7Oct 15, 2026 04:223,67739,259,22427,091,0003,066,00020,480
8Oct 15, 2026 04:225,81656,659,04944,478,0003,214,00020,480
9Oct 15, 2026 04:225,90657,383,52844,960,0003,471,00020,480