Can the set bit be counted at each position throughout the range [L, R]? 1 <= L, R <= 10^12

Example : [5, 13]

5:    101
6:    110
7:    111
8:   1000
9:   1001
10:  1010
11:  1011
12:  1100
13:  1101

0th position : 5 1st position : 4 2nd position : 5 3rd position : 6