Given a polynomial $P(x_{1}, x_{2}, \ldots, x_{n})$ which is the sum of terms, where each term is a product of two distinct variables, then the problem $APSS$ consists in calculating the total sum value of $\sum_{\forall U_{i}} P(u_{1}, u_{2}, \ldots, u_{n})$, for all the possible assignments $U_{i} = \{u_{1}, u_{2}, ... u_{n}\}$ to the variables such that $u_{j} \in \{0, 1\}$. $APSS$ is the abbreviation for the problem name Algebraic Polynomial Sum Solver Over $\{0, 1\}$. We show that $APSS$ is in $\#L$ and therefore, it is in $FP$ as well. The functional polynomial time solution was implemented with Scala in \url{https://github.com/frankvegadelgado/sat} using the DIMACS format for the formulas in $\textit{MONOTONE-2SAT}$.