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 13, 2023 00:21LiamLiamScore: 108,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2023 00:2197,073858,887,230796,002,34602,301,952
2Feb 13, 2023 00:21108,547954,460,761890,088,70402,183,168
3Feb 13, 2023 00:21122,9711,070,960,6371,008,358,96402,297,856