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 listSep 10, 2026 03:13Andrew EpsteinAndrew EpsteinScore: 5,159Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 10, 2026 08:30Tomislav Tunkovic22.31CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 03:145,09752,048,53439,743,0002,053,0002,117,632stderr
2Sep 10, 2026 03:145,14152,338,37540,077,0002,085,0002,117,632stderr
3Sep 10, 2026 03:145,14952,428,44340,144,0002,080,0002,117,632stderr
4Sep 10, 2026 03:145,15952,515,86540,256,0002,050,0002,117,632stderr
5Sep 10, 2026 03:145,15952,539,11939,289,0003,019,0002,117,632stderr
6Sep 10, 2026 03:145,16553,738,30240,316,0002,045,0002,117,632stderr
7Sep 10, 2026 03:145,17853,419,59139,357,0003,108,0002,117,632stderr
8Sep 10, 2026 03:145,18752,989,40539,488,0003,046,0002,117,632stderr
9Sep 10, 2026 03:145,23553,197,31539,725,0003,206,0002,117,632stderr