All challenges
Medium 0 solved 0% acceptance

Sum of Big Numbers

Add up a list of numbers too long for any built-in integer type.

What you'll learn

  • Add numbers stored as digit strings
  • Handle carries across columns
  • Remove leading zeros from a result

Problem

Each number arrives as a string of decimal digits and can be up to 60 digits long, far past what a 64-bit integer holds. Add them all and return the exact total. This is column addition from school: add digits from the right and carry into the next column.

Implement sum_of_big_numbers(numbers).

Input

numbers: Non-negative integers written as digit strings, without leading zeros (zero itself is "0").

Output

Return the exact sum as a digit string without leading zeros. An empty list sums to "0".

Constraints

0 ≤ numbers.length ≤ 100; each number has 1 to 60 digits

Examples

Example 1
Input:
numbers = ["999", "1"]

Expected output:
expected = "1000"
Input:
std::vector<std::string> numbers = {"999", "1"};

Expected output:
std::string expected = "1000";
Input:
string[] numbers = new string[] {"999", "1"};

Expected output:
string expected = "1000";

Explanation

Adding 1 to 999 carries through every column: "1000".

Example 2
Input:
numbers = ["98765432109876543210", "12345678901234567890"]

Expected output:
expected = "111111111011111111100"
Input:
std::vector<std::string> numbers = {"98765432109876543210", "12345678901234567890"};

Expected output:
std::string expected = "111111111011111111100";
Input:
string[] numbers = new string[] {"98765432109876543210", "12345678901234567890"};

Expected output:
string expected = "111111111011111111100";

Explanation

Column by column the two 20-digit numbers give "111111111011111111100", one digit longer than either.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Line the numbers up by their last digit.

Hint 2

Add one column at a time, keeping the carry for the next column.

Hint 3

When all columns are done, a leftover carry becomes new leading digits.

Expected complexity

O(total digits) time, O(max length) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.