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:35highload-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:362,48629,445,25820,391,000020,480
2Oct 15, 2026 01:362,49129,364,00420,429,000020,480
3Oct 15, 2026 01:362,49129,421,98020,432,000020,480
4Oct 15, 2026 01:362,49229,376,31920,441,000020,480
5Oct 15, 2026 01:362,49529,523,75320,464,000020,480
6Oct 15, 2026 01:362,49629,412,04820,473,000020,480
7Oct 15, 2026 01:362,49829,580,13420,487,000020,480
8Oct 15, 2026 01:362,50929,556,42220,580,000020,480
9Oct 15, 2026 01:365,85356,933,43044,644,0003,358,00020,480