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:58highload-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 15, 2026 01:592,49029,480,16720,418,000020,480
2Oct 15, 2026 01:592,49129,492,83120,428,000020,480
3Oct 15, 2026 01:592,49629,535,56520,469,000020,480
4Oct 15, 2026 01:592,49829,502,24020,485,000020,480
5Oct 15, 2026 01:592,50129,588,22920,515,000020,480
6Oct 15, 2026 01:592,50829,624,64920,566,000020,480
7Oct 15, 2026 01:593,61738,633,13126,253,0003,413,00020,480
8Oct 15, 2026 01:594,85048,742,41436,324,0003,446,00020,480
9Oct 15, 2026 01:595,89057,395,31544,859,0003,447,00020,480