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:03LiamLiamScore: 148,662Success
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:03102,972901,268,182844,368,93302,306,048
2Feb 13, 2023 00:03148,6621,289,371,8001,219,025,63402,248,704
3Feb 13, 2023 00:03149,9001,315,700,9641,229,177,86302,297,856