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 14:09highload-churnerhighload-churnerScore: 47,766Success
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 14:1046,120387,310,970375,182,0003,010,00032,768stderr
2Oct 13, 2026 14:1046,138387,277,217375,267,0003,068,00032,768stderr
3Oct 13, 2026 14:1046,158387,510,036375,483,0003,017,00032,768stderr
4Oct 13, 2026 14:1046,173387,652,354375,565,0003,057,00032,768stderr
5Oct 13, 2026 14:1047,766400,646,082385,597,0006,088,00028,672stderr
6Oct 13, 2026 14:1047,845401,296,268387,303,0005,033,00032,768stderr
7Oct 13, 2026 14:1048,192404,337,782390,138,0005,044,00032,768stderr
8Oct 13, 2026 14:1048,333405,314,026390,127,0006,204,00032,768stderr
9Oct 13, 2026 14:1069,516579,135,558548,839,00021,199,00032,768stderr