XOR Again

Problem #198

Find the sum of $i\wedge j$ modulo $10^9+7$ for all integers $i$ and $j$ in $[0,1073742824]$ .

$\wedge$ represents bitwise XOR operation.

Contributed by Aviroop Pal

Solved by 31 users

Log in to submit answers.

View All Submissions

Is something wrong?

Maintaining a collection of high quality questions is our top priority. If, however, you do find an error, report the problem and we'll make sure it is reviewed soon.