Take $x>0$ large, $t\in \mathbb R$, $q\in \mathbb N$ and a non-principal character $\chi $ mod $q$. If you want, take $t\leq x$. How do I bound

\[ \sum _{n\leq x}\frac {\chi (n)}{n^{it}}?\]

My guess was that this is $\ll \sqrt {qt}$, based on thinking about the $q=1$ case, which is the relatively well known statement

\[ \sum _{n\leq x}\frac {1}{n^{it}}=\text {main term }+\mathcal O\left (1\right ).\]

Euler-Maclaurin and Polya-Vinogradov shows the sum in question to be $\ll t\sqrt q$, which is too weak. But in the $q=1$ case EM may be combined with Van der Corput's summation formula to get an $\mathcal O(1)$ bound. If I try to replicate that argument, I get stuck since I don't know how to bound (for $a\in \mathbb N$ with $(a,q)=1$)

\[ \int _x^\infty \frac {e(ua/q)du}{u^{it}}\]

One idea would be with complex analysis: Perron's formula says for some $c>1$ and any $T>0$ the sum is (the error terms really only being "essentially" as small as stated)

$$\int _{c\pm iT}\frac {L_{\chi }(s+it)ds}{s}+\mathcal O\left (x/T\right )$$

where by the Residue Theorem the main term is, for some $0<c'<1$,

$$\int _{c'\pm iT}\frac {L_{\chi }(s+it)x^sds}{s} +\int _{c'+iT}^{c+iT}\frac {L_{\chi }(s+it)x^sds}{s}+(\text { similar integral }).$$

Taking absolute values gives a total error something like $$\ll x/T+\sqrt (T+|t|)$$ which is also too large. But explicitly computing the vertical integral via the functional equation seems to get better bounds, and give my required result.