Given N points which are d-dimensional, return the maximum Manhattan distance between 2 points.

I have written a code which runs in O(d*N^2) and gets a TLE.

Can anyone suggest me a faster solution?

Problem link: https://www.spoj.com/problems/DISTANCE

Thanks in advance