On the Subject of Carries

For once, those tiny 1s get some time in the spotlight. Hope they're not shy...

The module shows four five-digit numbers. Accumulate a total sum of these numbers, but only by adding two numbers at a time. These additions must be done with the numbers from top to bottom, with all but the first addition requiring the sum from the previous addition.

Once this calculation is complete, observe the carry digits that exist in the five possible positions they could appear in for each addition. Convert these from binary to decimal, then to a letter using A1Z26. The result from these carries, from top to bottom, form a three-letter word. Input this word to solve the module.

To input this word, take a look at the number at the bottom of the module, which is displayed in binary, starting at 1. Hitting either dim button multiplies this number by 2, but only the lower one will also add 1 to the number. Hitting the bright button will input that letter using A1Z26.

Letters will also be shown on the buttons for convenience. Determining the exact logic is left as an exercise for the reader.

A strike will occur if an incorrect button is pressed at any point. The solution will not change.

Example:

2059135124+++872381691914295355715159872000000000111111⟹ B⟹ Y⟹ E