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 11, 2021 19:31Yuriy LyfenkoYuriy LyfenkoScore: 130,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 19:31107,470944,416,691881,257,84302,289,664
2Jun 11, 2021 19:31130,6721,123,187,8251,071,507,25002,306,048
3Jun 11, 2021 19:31136,6901,194,937,1701,120,858,26102,285,568