Fast Fourier transform (2d or 3d).
Most trigonometric functions to any specified precision.
Finding the first "n" primes.
Defragmenting a disk with "n" fragments.
Technically, counting to "n" because eventually you would need longer and longer word-lengths.