We are looking for new challenges! Feel free to submit them on the GitHub
Add the numbers in the addresses 0x0 and 0x1 and store the result in the address 0x2. This challenge does not include a competition and is meant as warmup and for testing.
Expected result:memory[2] = memory[1] + memory[0]
Multiply the numbers in the addresses 0x0 and 0x1 and store the result in the address 0x2. Note that there is no multiply instruction in the MIMA. The multiplication is unsigned, and you can assume the input to be positive or zero integers.
Expected result:memory[2] = memory[1] * memory[0]
Given a list of values starting at address 0 and a length stored at address 0x40, calculate and then store the maximum value of the array at the address 0x41.
Expected result:memory[0x41] = max(memory[0..length])
Given a list of integers in the addresses between 0x0 and 0x40, sort the numbers in ascending order. The length of the array is also given.
Expected result:memory[0..length] = sort(memory[0..length])