title: Sum Two Large Numbers
signature: def sum_two_large_numbers(str1, str2):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(str1, str2, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              str1, str2),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver("VkfzrPG", "rKZ", "44527855")
      print(f"TEST-0...{result}")
  
      result = driver("0526110506447", "903", "0526110507350")
      print(f"TEST-1...{result}")
  
      result = driver("011010010", "110100000", "121110010")
      print(f"TEST-2...{result}")
  
      result = driver("sPAwZACc ", "liYMsojPiinOV", "66153436372942")
      print(f"TEST-3...{result}")
  
      result = driver("3", "611", "614")
      print(f"TEST-4...{result}")
  
      result = driver("0101", "01110101011", "01110101112")
      print(f"TEST-5...{result}")
  
      result = driver("VTtNu", "Wsmc", "469530")
      print(f"TEST-6...{result}")
  
      result = driver("2317170", "898421173423", "898423490593")
      print(f"TEST-7...{result}")
  
      result = driver("111111000010", "01100001110111", "01211112110121")
      print(f"TEST-8...{result}")
  
      result = driver("Ktt", "CTbbVX wGBkE", "2315420138859")
      print(f"TEST-9...{result}")
  
      sys.exit(0)
source_py: def sum_two_large_numbers(str1, str2):
      if (len(str1) > len(str2)):
          t = str1
          str1 = str2
          str2 = t
      str = ''
      n1 = len(str1)
      n2 = len(str2)
      str1 = str1[::(- 1)]
      str2 = str2[::(- 1)]
      carry = 0
      for i in range(n1):
          sum = ((ord(str1[i]) - 48) + ((ord(str2[i]) - 48) + carry))
          str += chr(((sum % 10) + 48))
          carry = int((sum / 10))
      for i in range(n1, n2):
          sum = ((ord(str2[i]) - 48) + carry)
          str += chr(((sum % 10) + 48))
          carry = int((sum / 10))
      if carry:
          str += chr((carry + 48))
      str = str[::(- 1)]
      return str
source_cpp: string sum_two_large_numbers(string str1, string str2) {
    if ( str1 . length ( ) > str2 . length ( ) ) swap ( str1, str2 );
    string str = "";
    int n1 = str1 . length ( ), n2 = str2 . length ( );
    reverse ( str1 . begin ( ), str1 . end ( ) );
    reverse ( str2 . begin ( ), str2 . end ( ) );
    int carry = 0;
    for ( int i = 0;
    i < n1;
    i ++ ) {
      int sum = ( ( str1 [ i ] - '0' ) + ( str2 [ i ] - '0' ) + carry );
      str . push_back ( sum % 10 + '0' );
      carry = sum / 10;
    }
    for ( int i = n1;
    i < n2;
    i ++ ) {
      int sum = ( ( str2 [ i ] - '0' ) + carry );
      str . push_back ( sum % 10 + '0' );
      carry = sum / 10;
    }
    if ( carry ) str . push_back ( carry + '0' );
    reverse ( str . begin ( ), str . end ( ) );
    return str;
  }