I know this was published over eight years ago, but I would still like to share my answer in case anyone else stumbles upon this topic.
,>,>++++++[-<--------<-------->>]<<[->[->+>+<<]>[-<+>]<<]>[-] >+>[->+<<<<+>>>]>[<<[-]+>>>[-]++++++++++<[->-[>]<<]<[-<<----- ----->>>>>>>+<<<<<]<[-<]>>>]>>>[-<<<<<<+>>>>>>]<<[-]<<<++++++ [-<++++++++<++++++++>>]<.[-]<.[-]
This uses eight space cells that must be initialized from scratch (if you use it in a larger program), and the pointer starts to the left of most of the eight cells. It will take two single-valued ASCII numbers and output a single-valued ASCII number. By ASCII number, I mean that it will receive and output the ASCII values ββof the characters that make up the number. When this program is completed, the pointer will again be at the very left end of the eight cells, and all cells will be returned to zero. The values ββthat will be obtained on the tape during normal operation will not fall below 0 or exceed 81, so you do not need to worry about negatives or hyphenation.
source share