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 05:31highload-churnerhighload-churnerScore: 7,382Success
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 05:327,35969,409,40260,349,000024,576stderr
2Oct 13, 2026 05:327,36569,427,15360,393,000024,576stderr
3Oct 13, 2026 05:327,36769,437,16060,414,000024,576stderr
4Oct 13, 2026 05:327,38069,469,23059,505,0001,017,00024,576stderr
5Oct 13, 2026 05:327,38269,489,22459,536,0001,003,00024,576stderr
6Oct 13, 2026 05:327,38669,610,65059,535,0001,035,00024,576stderr
7Oct 13, 2026 05:327,38869,629,50359,578,0001,005,00024,576stderr
8Oct 13, 2026 05:327,39269,589,77859,619,0001,000,00024,576stderr
9Oct 13, 2026 05:327,40469,718,23259,715,0001,000,00024,576stderr