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:36Andrey TsvetkovAndrey TsvetkovScore: 143,720Success
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:35128,3041,115,896,8641,052,092,62402,191,360
2Jun 20, 2021 13:35130,5141,128,745,0911,070,216,75802,252,800
3Jun 20, 2021 13:35133,2991,143,198,4401,093,054,45902,281,472
4Jun 20, 2021 13:36143,7202,183,992,8881,178,501,39405,881,856
5Jun 20, 2021 13:36144,1741,466,251,5901,182,224,34002,236,416
6Jun 20, 2021 13:36158,3944,243,211,3711,298,831,79402,269,184