Rotate the string one bit at a time; check n-th bit (or zeroth bit) if it is 1, increase the count. You have to rotate string n time to appear all bits in n-th position (on in zeroth position).
You can also use a char pointer to check each char of the array which should be faster that rotate but without a loop I don't see a way to do what you want.