The O(n log n) algorithm is galactic (only becomes more efficient when multiplying massive numbers)

So for numbers we normally work with, no. Maybe with cryptographic operations though.