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 12:27Andrey TsvetkovAndrey TsvetkovScore: 165,505Success
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 12:27152,8043,869,886,6791,252,991,33502,260,992
2Jun 20, 2021 12:27165,5054,628,012,5371,357,145,04702,252,800
3Jun 20, 2021 12:27176,2523,712,495,7831,445,263,70503,780,608