Add large numbers with column addition — see every carry, every column sum, and the final total laid out step by step. Free and educational.
Home » Math Calculators » Long Addition Calculator
Long addition (column addition) adds multi-digit numbers by stacking them vertically, adding column by column from right to left, and carrying tens into the next column. It is the first multi-digit algorithm children learn — and the one every other arithmetic method builds on. Our free Long Addition Calculator performs column addition on any two numbers and displays each column’s sum and every carry, so the method is fully visible.
The algorithm works because of place value: each column represents units, tens, hundreds, and so on. Adding column-wise with carries is just regrouping — ten units become one ten, ten tens become one hundred — applied systematically. The calculator’s step display makes this regrouping explicit.
Beyond homework, column addition is how you verify mental math, add long columns of figures (hence “adding machine”), and understand what calculators do internally. The steps the calculator shows are the same ones you would write by hand — checkable at every column.
Column addition exploits place value: 4785 = 4·1000 + 7·100 + 8·10 + 5. Adding 4785 + 2693 column-wise adds the ones (5+3), tens (8+9), hundreds (7+6), thousands (4+2) — but whenever a column reaches 10+, ten of that unit regroup as one of the next: the carry. The algorithm is regrouping, mechanized.
The carry is the heart of it. In the tens column of 4785 + 2693: 8 + 9 = 17 tens = 1 hundred + 7 tens. Write 7, carry 1 hundred. Each carry is just the statement “ten of these make one of those” applied at the right moment. The calculator labels every carry so the regrouping is never mysterious.
Why right-to-left? Because carries flow leftward (small units to large). Starting at the ones guarantees each column’s carry is known before the next column is summed. Left-to-right would require revisiting columns — the algorithm’s direction is forced by the carry flow.
The method generalizes: add more numbers by stacking them all, add decimals by aligning the point, add in other bases by carrying at the base. Column addition is the template for all positional arithmetic.
Stack numbers right-aligned; for each column right to left: sum digits + carry; write sum mod 10, carry floor(sum/10).
A final nonzero carry becomes a new leftmost digit.
Ones: 5+3 = 8, write 8. Tens: 8+9 = 17, write 7 carry 1. Hundreds: 7+6+1 = 14, write 4 carry 1. Thousands: 4+2+1 = 7, write 7. Result: 7478.
Ones: 9+1 = 10, write 0 carry 1. Tens: 9+0+1 = 10, write 0 carry 1. Hundreds: 9+0+1 = 10, write 0 carry 1. Final carry → 1000. Cascading carries are the classic stress test.
Align right: 12345 + 00678. Ones: 5+8 = 13, write 3 carry 1. Tens: 4+7+1 = 12, write 2 carry 1. Hundreds: 3+6+1 = 10, write 0 carry 1. Thousands: 2+0+1 = 3. Ten-thousands: 1. Result: 13023.
Ones through hundreds: 0+0 = 0. Thousands: 5+5 = 10, write 0 carry 1 → 10000. Round numbers still exercise the carry logic.
A cashier totals a bill: $47.85 + $26.93 (as 4785 + 2693 cents) = 7478 cents = $74.78. The column steps — 5+3, 8+9 carry, 7+6 carry, 4+2 carry — are exactly what the calculator displays, and what a receipt audit would check.
An accountant adds a column of invoices: 12,400 + 8,750 + 3,225. Pairwise column addition (12,400+8,750 = 21,150; +3,225 = 24,375) with carries verified at each step catches the transposition errors mental math misses.
A student checks 999 + 1 = 1000 by the cascade: three columns each producing 10, each carrying. The calculator’s step list turns the “magic” of 999+1 into visible regrouping.
Every column sum computes (digit_a + digit_b + carry) = 10·new_carry + written_digit — the division algorithm applied to the column total. The written digit is the remainder mod 10; the carry is the quotient. Column addition is repeated division-with-remainder, disguised as arithmetic.
This reveals why the algorithm is correct: each column’s contribution to the total is (written_digit + 10·carry)·10^position, and telescoping the carries reconstructs exactly a + b. The proof is a one-line induction on columns — the calculator’s steps are the induction made visible.
Computers add the same way at heart: binary full-adders compute sum and carry bits per column, rippling the carry leftward — literally “column addition” in base 2. The third-grade algorithm and the CPU’s adder are the same idea in different bases.
Column addition is linear time in the number of digits — O(n) — and it is optimal: you must read every digit. But the carry chain is inherently sequential, which is why fast adders (carry-lookahead, prefix adders) compute carries in parallel with O(log n) depth. The third-grade algorithm and the CPU’s adder differ only in how they parallelize the carry — the mathematics is identical.
Adding decimals uses identical columns: align the point, pad with zeros, add as whole numbers, replace the point. 4.75 + 23.8 → 04.75 + 23.80 → 28.55. The point is just another column boundary — the algorithm does not care where it sits.
Check by casting out nines: the digital root of a sum equals the sum of digital roots (mod 9). 4785 → 4+7+8+5 = 24 → 6; 2693 → 2+6+9+3 = 20 → 2; total 7478 → 7+4+7+8 = 26 → 8; and 6+2 = 8 ✓. A mismatch proves an error (a match does not prove correctness, but it catches most slips).
For very long columns (dozens of numbers), add in chunks and subtotal — the associative law guarantees the grouping does not matter. Accountants subtotal every page for exactly this reason: it localizes errors to one chunk.
Ones: 9+1 = 10, write 0 carry 1. Tens: 9+0+1 = 10, write 0 carry 1. Hundreds: 1+2+1 = 4. Result: 400. Near-complements sum cleanly.
Each column: 7+2 = 9, no carries at all. Result: 9999. Not every addition carries — the steps confirm the quiet columns too.
Ones: 5+5 = 10, write 0 carry 1. Tens: 0+9+1 = 10, write 0 carry 1. Hundreds: 4+7+1 = 12, write 2 carry 1. Thousands: 0+9+1 = 10, write 0 carry 1. Ten-thousands: 6+3+1 = 10, write 0 carry 1 → 100200. A full cascade.
Add 789 + 456 by columns by hand, writing each carry. Verify the total and every carry with the calculator.
Add 99,999 + 1. Predict the cascade before computing — how many columns carry? Check against the step list.
Add three numbers: 123 + 456 + 789. (Hint: add two, then add the third.) What is the largest single column sum you encounter?
An auditor verifies a handwritten ledger column: 4,785 + 2,693 + 1,522. The clerk’s total reads 8,990 — but column addition gives 9,000. The auditor’s step list: ones 5+3+2 = 10 (write 0, carry 1); tens 8+9+2+1 = 20 (write 0, carry 2); hundreds 7+6+5+2 = 20 (write 0, carry 2); thousands 4+2+1+2 = 9. Total 9,000 — the clerk dropped a carry. Ten dollars of error, caught by the algorithm.
The firm now requires the carry column written explicitly on every manual total — the calculator’s step display is the training model. Column addition is not just arithmetic; it is the audit trail.
The Long Addition Calculator adds two non-negative whole numbers using right-to-left column addition with explicit carries, displaying the total and a per-column step list naming each place value (ones, tens, …), the column sum, the written digit, and any carry generated, including a final carry as a new leftmost digit.
Stack the numbers right-aligned. Add each column right to left: sum the digits plus any incoming carry, write sum mod 10, carry floor(sum/10) to the next column.
Regrouping: when a column sums to 10+, ten of that unit become one of the next-larger unit. 8+9 = 17 tens = 1 hundred + 7 tens — write 7, carry 1.
Carries flow leftward (small to large units). Starting at the ones ensures each column’s incoming carry is known before you sum it.
Each column sums to 10 (write 0, carry 1), cascading three times, plus a final carry: 1000. The calculator shows every cascade step.
Yes — align the decimal points (4.50 + 23.75), which right-aligns every place value. Then add columns as usual.
Write 5, carry 2. The carry is floor(25/10) = 2 — carries are not always 1 when adding multiple numbers or large digits.
Binary full-adders compute per-column sum and carry bits, rippling carries leftward — column addition in base 2, the same algorithm.
7478. Ones 5+3=8; tens 8+9=17 (write 7, carry 1); hundreds 7+6+1=14 (write 4, carry 1); thousands 4+2+1=7.
Cite this page as: Long Addition Calculator. Sigma Calculator. Retrieved October 10, 2026, from https://sigmacalculator.net/math-calculators/long-addition-calculator/
Last updated: October 10, 2026