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:13highload-churnerhighload-churnerScore: 2,505Success
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:152,49629,432,52020,471,000020,480
2Oct 13, 2026 12:152,49729,470,47120,480,000020,480
3Oct 13, 2026 12:152,49929,476,35420,498,000020,480
4Oct 13, 2026 12:152,50429,472,37020,540,000020,480
5Oct 13, 2026 12:152,50529,552,35320,542,000020,480
6Oct 13, 2026 12:152,50729,651,12220,564,000020,480
7Oct 13, 2026 12:152,50929,543,20820,581,000020,480
8Oct 13, 2026 12:1537,896319,753,716309,735,0001,020,00020,480
9Oct 13, 2026 12:1538,299323,068,617314,058,000020,480