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 13, 2021 18:44Yurkov AlekseyYurkov AlekseyScore: 41,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 18:4439,206391,534,828321,492,45002,174,976
2Jun 13, 2021 18:4441,996410,762,461344,364,40802,297,856
3Jun 13, 2021 18:4452,005505,963,594426,444,10702,301,952