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 20, 2021 13:57Andrey TsvetkovAndrey TsvetkovScore: 93,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 13:5780,387712,000,119659,174,24502,228,224
2Jun 20, 2021 13:5793,015831,322,484762,719,07502,293,760
3Jun 20, 2021 13:5799,519880,499,625816,056,30002,306,048