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 04:10highload-churnerhighload-churnerScore: 5,228Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 13, 2026 12:08Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 04:124,93851,147,00638,346,0002,146,0002,113,536
2Oct 9, 2026 04:125,08152,880,94739,496,0002,176,0002,117,632
3Oct 9, 2026 04:125,21353,370,93940,714,0002,035,0002,117,632
4Oct 9, 2026 04:125,22153,946,71640,654,0002,165,0002,117,632
5Oct 9, 2026 04:125,22853,459,88840,838,0002,034,0002,117,632
6Oct 9, 2026 04:125,30854,094,85241,493,0002,035,0002,117,632
7Oct 9, 2026 04:125,33654,348,52341,595,0002,164,0002,117,632
8Oct 9, 2026 04:125,43355,789,53741,522,0003,035,0002,117,632
9Oct 9, 2026 04:1228,171241,604,149228,890,0002,117,0002,117,632