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 17, 2024 00:33zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:5708,872,3621,072,000020,480No answer to stdout. Died or killed?
2Oct 17, 2024 00:333,51856,074,96327,851,000994,0002,482,176
3Oct 17, 2024 00:333,52153,520,24028,869,00002,416,640
4Oct 17, 2024 00:333,52857,232,59725,937,0002,992,0002,445,312