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:51zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:4508,805,6081,075,000020,480No answer to stdout. Died or killed?
2Oct 17, 2024 00:513,41853,249,86427,027,0001,001,0002,527,232
3Oct 17, 2024 00:513,43252,761,70624,122,0004,020,0002,342,912
4Oct 17, 2024 00:513,45651,710,93924,291,0004,048,0002,433,024