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 listFeb 17, 2023 19:34LiamLiamScore: 123,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2023 19:34117,5831,024,782,623964,180,81802,183,168
2Feb 17, 2023 19:34123,8701,078,735,2161,015,732,63702,289,664
3Feb 17, 2023 19:34146,6051,256,947,0751,202,162,88502,293,760