EDIT If you read the wikipedia article, and follow the links, you will see that if the size of the elements is bounded (for example, by $10$) the problem can be solved using dynamic programming in $O(n^2)$ time, where $n$ is the number of "digits".