For each two things in the INBOX, multiply them, and OUTBOX the result. Don’t worry about negative numbers for now.
Add together all the numbers in each string. When you reach the end of a string (marked by a ZERO), put your sum in the OUTBOX. Reset and repeat for each string.
For each thing in the INBOX, send to the OUTBOX the full Fibonacci Sequence up to, but not exceeding that value. For example, if INBOX is 10, OUTBOX would be 1 1 2 3 5 8.
1 1 2 3 5 8 13 21 34 55 89 …
For each zero terminated string in the INBOX, send to the OUTBOX only the SMALLEST number you’ve seen in that string. You will never be given an empty string. Reset and repeat for each string.
For each two things in the INBOX, OUTBOX the remainder that would result if you had divided the first by the second. Don’t worry, you don’t actually have to divide. And don’t worry about negative numbers for now.
For each thing in the INBOX, OUTBOX the sum of itself plus all numbers down to zero. For example, if INBOX is 3, OUTBOX should be 6, because 3+2+1=6.
For each two things in the INBOX, how many times does the second fully fit into the first? Don’t worry about negative numbers, divide by 0, or remainders.
For each THREE THINGS in the INBOX, send them to the OUTBOX in order from smallest to largest.
Imagine each thing in the INBOX is an address. And each address refers to a tile 0-9 on the floor. Your task: For each address in the INBOX, pick up the letter at that address and OUTBOX it.