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 listApr 19, 2026 01:26zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:07Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:0708,880,7961,164,000020,480No answer to stdout. Died or killed?
2Apr 19, 2026 01:262,78347,227,81222,824,00002,404,352
3Apr 19, 2026 01:262,83342,614,86221,210,0002,020,0002,424,832
4Apr 19, 2026 01:265,33769,045,12340,778,0002,983,0002,342,912