Bug Report for https://neetcode.io/problems/number-of-one-bits

Please describe the bug below and include any steps to reproduce the bug or screenshots if possible.

Here, The solution for the problem is said to be O(1) running time. but the correct answer would be O(logn) running because each time I'm right shifting the number. Okay it's guaranteed that this loop will run at most 31 times for the worst case. but that In relative to n the time would be O(logn)