I actually did all the ASCII to binary and the addition part easily with multipliers and adders
That's quite complicated. You don't need multipliers. You have a number in the BCD form, and you can easily just do the addition in BCD as well.
ASCII to binary-coded-decimal (BCD) is trivial: you just leave the 4 lower bits.
The addition can be done using a separate adder for each pair of digits.
Decimal adjustment is done for each digit of the result - the equivalent of DAA
opcode on many CPUs.
The decimal adjust detection is the also the decimal carry signal.
And now you got the 4 lower bits of each ASCII digit. The upper bits remain unchanged and can be passed straight from the input, so we can set them aside since their "circuit" is just straight wires from input to output.
BCD adjustment is done as follows: the sum is compared to 10. Such comparison is done by subtracting 10. Instead, we add twos-complement -10 = 0110b. That also happens to be +6! So subtracting 10 and adding 6, modulo 16, are the same operation. If the sum is >9, or >15, the 6 is added to it. Since we already have the result of adding 6, we just choose between the original result of addition, and the result with the 6 added to it.
The >9 or >15 condition from the BCD adjuster also is the decimal carry signal and is fed to the adder for the next digit.
You can play with the simulation below by selecting any of the input digits with the mouse, so that it turns red, and pressing space to toggle it.
As shown, the adder performs 99+42=141.
simulate this circuit – Schematic created using CircuitLab