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 02:15highload-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 02:172,49229,420,03620,437,000020,480
2Oct 15, 2026 02:172,49529,508,45620,467,000020,480
3Oct 15, 2026 02:172,49629,391,27520,474,000020,480
4Oct 15, 2026 02:172,49629,512,14020,474,000020,480
5Oct 15, 2026 02:172,49729,471,85120,481,000020,480
6Oct 15, 2026 02:172,50129,548,55320,515,000020,480
7Oct 15, 2026 02:174,15843,007,45030,769,0003,333,00020,480
8Oct 15, 2026 02:175,84957,463,77344,581,0003,388,00020,480
9Oct 15, 2026 02:176,01658,494,00446,283,0003,052,00020,480