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 listJun 19, 2021 13:17alex3dalex3dScore: 1,010,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 13:171,010,3318,343,953,2158,284,716,09102,183,168
2Jun 19, 2021 13:171,010,6478,352,914,2478,287,308,10402,306,048
3Jun 19, 2021 13:171,013,2958,367,562,8538,309,015,94902,174,976