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 listMar 28, 2026 21:51Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:41Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 11:41013,432,4792,375,0001,187,00020,480No answer to stdout. Died or killed?
2Mar 28, 2026 21:514,10263,456,76232,614,0001,019,0002,465,792
3Mar 28, 2026 21:514,13660,366,18731,920,0001,995,0002,351,104
4Mar 28, 2026 21:514,25958,249,86833,929,000997,0002,433,024