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 9, 2026 17:18highload-churnerhighload-churnerScore: 3,870Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 17:183,72239,987,02029,493,0001,029,00024,576
2Oct 9, 2026 17:183,85140,559,61630,550,0001,032,00024,576
3Oct 9, 2026 17:183,86440,723,16330,663,0001,029,00024,576
4Oct 9, 2026 17:183,86840,696,68730,689,0001,029,00024,576
5Oct 9, 2026 17:183,87040,670,46030,709,0001,029,00024,576
6Oct 9, 2026 17:183,93241,200,36731,217,0001,032,00024,576
7Oct 9, 2026 17:183,99041,573,70530,705,0002,014,00024,576
8Oct 9, 2026 17:184,00641,905,40931,826,0001,030,00024,576
9Oct 9, 2026 17:184,04142,128,16732,113,0001,031,00024,576