  For $g \ge 2$, we show that the number of positive integers at most $X$ which
can be written as sum of two base $g$ palindromes is at most $\frac{X}{\log^c
X}$. This answers a question of Baxter, Cilleruelo and Luca.
