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:32Yuriy LyfenkoYuriy LyfenkoScore: 113,644Success
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:32100,951890,087,421827,801,01702,306,048
2Jun 11, 2021 19:32113,644992,357,736931,879,18802,301,952
3Jun 11, 2021 19:32113,756997,625,397932,798,66702,310,144