Hard Number Theory · Superchallenge problem

Let $f(n) = \displaystyle\sum_{k=1}^{n} (n \bmod k)$, where $n \bmod k$ is the remainder when $n$ is divided by $k$. Find $f(2026) - f(2025)$.