The time complexity of k-dimensional Mo's is $$$O(q * B + (n/B)^{k-1}n)$$$ (assuming $$$k$$$ is a constant). Choosing $$$B = O(n / q^{1/k})$$$ gives a time complexity of $$$n \cdot q^{1-1/k}$$$. See https://mirror.codeforces.com/blog/entry/61203?#comment-451304 for more information and proof of the $$$n \cdot q^{1-1/k}$$$ lower bound.

If you do 4d mo, just write a quadratic solution with good constant factor, and it will be faster