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 12:46highload-churnerhighload-churnerScore: 2,501Success
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 12:472,49529,485,02720,465,000020,480
2Oct 13, 2026 12:472,49629,242,43720,470,000020,480
3Oct 13, 2026 12:472,49629,510,36620,470,000020,480
4Oct 13, 2026 12:472,49930,984,52320,496,000020,480
5Oct 13, 2026 12:472,50129,464,84920,513,000020,480
6Oct 13, 2026 12:472,50229,506,28720,517,000020,480
7Oct 13, 2026 12:472,50629,575,18720,557,000020,480
8Oct 13, 2026 12:472,52629,656,86420,719,000020,480
9Oct 13, 2026 12:472,52629,734,09720,719,000020,480