Is better than O(n^2) possible for getting pairs that sum to a multiple of 10?
It is not possible to have an algorithm that is faster than $O(n^2)$ as the output can be $O(n^2)$ — all pairs. This can happen when all numbers are divisible by 10, or all are returning 5 when taken modulo 10.