Lets say there is a turing machine $M$ where
\begin{align*}
M &= (Q, \Sigma, \Gamma, \delta, q_1, q_{accept}, q_{reject}) \\
Q &= \{q_1, q_2, q_3, q_{accept}, q_{reject} \} \\
Σ &= \{0, 1\} \\
Γ &= \{0, 1, U\}
\end{align*}
with transition functions \begin{align*} \delta (q_1, U) &= (q_1, U, R)\\ \delta (q_1, 0) &= (q_1, 0, R)\\ \delta (q_1, 1) &= (q_2, 1, R)\\ \delta (q_2, U) &= (q_{accept}, U, R)\\ \delta (q_2, 0) &= (q_3, 0, R)\\ \delta (q_2, 1) &= (q_2, 1, R)\\ \delta (q_3, U) &= (q_3, U, R)\\ \delta (q_3, 0) &= (q_3, 0, R)\\ \delta (q_3, 1) &= (q_3, 1, R) \end{align*}
If I input a string and it reaches the $q_{accept}$ state while there are still letters remaining in the string, would it count as accepting the string, rejecting the string, something else?