The short answer is yes, and this is treated explicitly for characters in the work of Granville and Soundararajan (the paper appeared in J. Amer. Math. Soc.). Their Theorem 2 gives that on GRH for $x\le q$ and a primitive character $\chi \pmod q$ one has $$ \Big| \sum_{n\le x} \chi(n) \Big| \ll \Psi(x, (\log q)^2 (\log \log q)^{20}), $$ where $\Psi(x,y)$ denotes the number of integers up to $x$ composed only of prime factors below $y$. From this and partial summation, it follows at once that for $x\le q$ $$ \Big| \sum_{n\le x} \frac{\chi(n)}{n} \Big| \ll \prod_{p\le (\log q)^2(\log \log q)^{20}} \Big(1- \frac{1}{p}\Big)^{-1} \ll \log \log q. $$ In fact their Theorem 2 is a bit more precise, and one should be able to get the Littlewood type constant also. This result will also extend to the $t$-aspect with minor changes, and establish the bound that you want.

Alternatively you could look at another paper of Granville and Soundararajan (also in JAMS, and also in the case of characters); the argument given there in Section 5 would give a slightly simpler approach to such results.

The short answer is yes, and this is treated explicitly for characters in the work of Granville and Soundararajan (the paper appeared in J. Amer. Math. Soc.). Their Theorem 2 gives that on GRH for $x\le q$ and a primitive character $\chi \pmod q$ one has $$ \Big| \sum_{n\le x} \chi(n) \Big| \ll \Psi(x, (\log q)^2 (\log \log q)^{20}), $$ where $\Psi(x,y)$ denotes the number of integers up to $x$ composed only of prime factors below $y$. From this and partial summation, it follows at once that for $x\le q$ $$ \Big| \sum_{n\le x} \frac{\chi(n)}{n} \Big| \ll \prod_{p\le (\log q)^2(\log \log q)^{20}} \Big(1- \frac{1}{p}\Big)^{-1} \ll \log \log q. $$ In fact their Theorem 2 is a bit more precise, and one should be able to get the Littlewood type constant also. This result will also extend to the $t$-aspect with minor changes, and establish the bound that you want.

Alternatively you could look at another paper of Granville and Soundararajan (also in JAMS, and also in the case of characters); the argument given there in Section 5 would give a slightly simpler approach to such results.

Here's a quick sketch proof based on the second approach. Let $|t|$ be large, and assume that $x\le |t|$ (for larger $x$ the partial sum simply approximates $\zeta(1+it)$). Let $y$ be a parameter to be chosen, and note that $n\le x$ is either $y$-smooth, or may be written as $n=mp$ where $p\ge y$ is the largest prime factor of $n$ (so that $m$ is $p$-smooth). Thus, with $P(m)$ denoting the largest prime factor of $m$,
$$ \sum_{n\le x} \frac{1}{n^{1+it}} = \sum_{\substack{n\le x\\ p|n \implies p\le y}} \frac{1}{n^{1+it}} + \sum_{m\le x/y} \frac{1}{m^{1+it}} \sum_{\max(y, P(m)) \le p \le x/m} \frac{1}{p^{1+it}}. $$ The first term in the RHS is simply bounded by $\prod_{p\le y} (1-1/p)^{-1}$. As for the second term, RH can be used (usual contour shift argument) to show that the sum over $p$ there is $$ \ll \frac{(\log |t|)}{\sqrt{y}}, $$ and bounding the sum over $m$ trivially, the second term is $$ \ll \frac{(\log |t|) \log x}{\sqrt{y}} \ll \frac{(\log |t|)^2}{\sqrt{y}}. $$ Now choosing $y=(\log |t|)^4$ gives a bound of $\ll \log \log |t|$ for your partial sums. With more care the product may be truncated at $y=(\log |t|)^{2+\epsilon}$. One would expect that truncation at $y=(\log |t|)^{1+\epsilon}$ (or even $y=C \log |t| \log \log |t|$) is the truth.

The short answer is yes, and this is treated explicitly for characters in the work of Granville and Soundararajan (the paper appeared in J. Amer. Math. Soc.). Their Theorem 2 gives that on GRH for $x\le q$ and a character $\chi \pmod q$ one has $$ \Big| \sum_{n\le x} \chi(n) \Big| \ll \Psi(x, (\log q)^2 (\log \log q)^{20}), $$ where $\Psi(x,y)$ denotes the number of integers up to $x$ composed only of prime factors below $y$. From this and partial summation, it follows at once that for $x\le q$ $$ \Big| \sum_{n\le x} \frac{\chi(n)}{n} \Big| \ll \prod_{p\le (\log q)^2(\log \log q)^{20}} \Big(1- \frac{1}{p}\Big)^{-1} \ll \log \log q. $$ In fact their Theorem 2 is a bit more precise, and one should be able to get the Littlewood type constant also. This result will also extend to the $t$-aspect with minor changes, and establish the bound that you want.

Alternatively you could look at another paper of Granville and Soundararajan (also in JAMS, and also in the case of characters); the argument given there in Section 5 would give a slightly simpler approach to such results.

The short answer is yes, and this is treated explicitly for characters in the work of Granville and Soundararajan (the paper appeared in J. Amer. Math. Soc.). Their Theorem 2 gives that on GRH for $x\le q$ and a primitive character $\chi \pmod q$ one has $$ \Big| \sum_{n\le x} \chi(n) \Big| \ll \Psi(x, (\log q)^2 (\log \log q)^{20}), $$ where $\Psi(x,y)$ denotes the number of integers up to $x$ composed only of prime factors below $y$. From this and partial summation, it follows at once that for $x\le q$ $$ \Big| \sum_{n\le x} \frac{\chi(n)}{n} \Big| \ll \prod_{p\le (\log q)^2(\log \log q)^{20}} \Big(1- \frac{1}{p}\Big)^{-1} \ll \log \log q. $$ In fact their Theorem 2 is a bit more precise, and one should be able to get the Littlewood type constant also. This result will also extend to the $t$-aspect with minor changes, and establish the bound that you want.

Alternatively you could look at another paper of Granville and Soundararajan (also in JAMS, and also in the case of characters); the argument given there in Section 5 would give a slightly simpler approach to such results.