Deriving the Time Complexity of Ryser's Algorithm for Evaluating the Permanent of a Matrix
For a given $s$, you do $(|s|-1)n$ additions, not $|s|-1$ additions: you have to compute the inner sum for each $i\in [n]$. Thus, you are missing a factor of $n$.