Hamming Distance

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integers x and y , calculate the Hamming distance.

Note:0 ≤ x , y< 231.
Example:
Input: x = 1, y = 4
Output: 2
Explanation:1 (0 0 0 1)4 (0 1 0 0) ↑ ↑The above arrows point to positions where the corresponding bits are different.

    #include <iostream>
    #include <math.h>
    using namespace std;
    int main() {
        int x, y;
        cin >> x;
        cin >> y;
        int value = x ^ y;
        int distance = 0;
        for (int i = 0; i < 32; i++) {
            int re = (1 << i) & value;
            if (re > 0) {
                distance++;
            }
        }
        cout << distance;
        return distance;
    }