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: 39,334Success
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:4438,991383,631,305319,727,82402,297,856
2Jun 13, 2021 18:4439,334372,651,268322,542,64902,293,760
3Jun 13, 2021 18:4442,825428,371,327351,161,36202,293,760