Time Complexity of Unique number 3 problem

[Shivansh-Srivastava-2813454628880698 (Shivansh Srivastava)]

I was solving the Unique number 3 problem but I was confused regarding the TC of the method suggested in the video. If its O(n*K)? where k is the maximum number of bits and n is size of array.

[Saurabh-Kumar-1331476656958199 (Saurabh Kumar)]

yes its time complexity is O(n*k) where k is number of bits.