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 16, 2024 01:38zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:56Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:56010,342,6782,386,000020,480No answer to stdout. Died or killed?
2Oct 16, 2024 01:383,48154,503,91226,503,0002,038,0002,375,680
3Oct 16, 2024 01:383,52052,569,13428,862,00002,523,136
4Oct 16, 2024 01:383,53855,174,52426,013,0003,001,0002,465,792