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 01:08highload-churnerhighload-churnerScore: 2,495Success
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 01:092,49129,336,98620,427,000020,480
2Oct 15, 2026 01:092,49329,418,58320,443,000020,480
3Oct 15, 2026 01:092,49529,424,59020,461,000020,480
4Oct 15, 2026 01:092,49529,550,50220,466,000020,480
5Oct 15, 2026 01:092,49529,551,27520,462,000020,480
6Oct 15, 2026 01:092,49829,523,12620,490,000020,480
7Oct 15, 2026 01:092,49829,630,15220,487,000020,480
8Oct 15, 2026 01:092,50029,533,54020,505,000020,480
9Oct 15, 2026 01:095,90757,355,03144,972,0003,469,00020,480