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:36LiamLiamScore: 137,419Success
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:36110,716975,639,419907,875,28202,297,856
2Feb 17, 2023 19:36110,983964,283,825910,063,69102,297,856
3Feb 17, 2023 19:36136,2471,180,033,3611,117,222,47402,289,664
4Feb 17, 2023 19:36137,4191,188,149,0731,126,839,86702,306,048
5Feb 17, 2023 19:36170,8071,455,140,7381,400,620,83502,285,568
6Feb 17, 2023 19:36176,0391,509,802,3531,443,518,29202,297,856