Optimal inversion counting on int arrays

Question

Today I was looking the latest exam of the local informatics olympiad and I found a interesting problem. Briefly, it asks to, given an integer array, count how many inversions i

Answer 1

The best result in the literature is an O(n √(log n)) algorithm due to Chan and Patrascu. No idea about the constant.