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 03:22highload-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 03:222,49229,408,46420,441,000020,480
2Oct 15, 2026 03:222,49429,540,78320,457,000020,480
3Oct 15, 2026 03:222,49529,425,49020,467,000020,480
4Oct 15, 2026 03:222,49629,445,90120,473,000020,480
5Oct 15, 2026 03:222,49729,557,27620,481,000020,480
6Oct 15, 2026 03:223,64238,827,15326,362,0003,504,00020,480
7Oct 15, 2026 03:225,77556,311,45744,304,0003,058,00020,480
8Oct 15, 2026 03:225,86157,141,33944,611,0003,457,00020,480
9Oct 15, 2026 03:225,86857,107,29544,700,0003,419,00020,480