Given two floating-point vectors $x,y$ of dimension $n$ and assuming rounding to nearest, we show that if no underflow or overflow occurs, any evaluation order for inner product returns a floating-point number $\hat r$ such that $|{\hat r}-x^Ty| \le nu|x|^T|y|$ with $u$ the unit roundoff. This result, which holds for any radix and with no restriction on $n$, can be seen as a generalization of a similar bound given in~\cite{Rump12} for recursive summation in radix $2$, namely $|{\hat r}- x^Te| \le (n-1)u|x|^Te$ with $e=[1,1,\ldots,1]^T$. As a direct consequence, the error bound for the floating-point approximation $\hat C$ of classical matrix multiplication with inner dimension $n$ simplifies to $|\hat{C}-AB|\le nu|A||B|$.