Linear counter with arbitrary standard error implemented

I've implemented binary search to find minimum bit mask length that satisfy precision inequality from original paper. Search runs in O(log n) which is quite fast for practical applications.