We've already proven we're good at adding two numbers, but many solutions only operate on tiny numbers like 2³²-1, honestly we can do a lot better.
Given two unsigned, non-negative integers, add them together and return the output.
Input may be taken in any convenient format (String, Array of bytes/characters, BigInteger, etc.), and output may be in any convenient format as well. Inputs may optionally be padded with any character of choice to any length of choice.
Output must support at minimum all numbers in the range of [0,10²⁵⁶), Inputs will always be in this range as well.
1168 + 0112 = 1280 23101333 + 01858948 = 24960281 242942454044 + 167399412843 = 410341866887 9398246489431885 + 9300974969097437 = 18699221458529322 83508256200399982092 + 74143141689424507179 = 157651397889824489271 173163993911325730809741 + 291008926332631922055629 = 464172920243957652865370
- Standard IO Applies
- Standard Loopholes Apply
- You may not output as Scientific Notation. All digits must be included in the output.
- Solutions do not need to finish in any reasonable time, they only must provably work.
- Use of built-in BigInteger implementations is allowed, though I encourage you to include a non-built-in solution.
- This is code-golf so fewest bytes wins!
- I/O may not be taken as Unary.
- Have Fun!