ModAdd

import sys
def carryLessSum(a, b):
	out = [0] * len(a)
	i = 0
	while i<len(a):
		t = int(a[i]) + int(b[i])
		t = str(t)
		out[i] = t[-1]
		i = i+1
	
	out = ''.join(out)
	out = int(out)
	return out
input_1 = sys.stdin.readline()
input_2 = sys.stdin.readline()
input_1 = list(input_1)
input_2 = list(input_2)
del(input_1[-1])
del(input_2[-1])
if (len(input_1)>len(input_2)):
	l = [0] * len(input_1)
	diff = len(input_1) - len(input_2)
	l[diff:] = input_2
	print(carryLessSum(input_1, l))
elif (len(input_1)<len(input_2)):
	l = [0] * len(input_2)
	diff = len(input_2) - len(input_1)
	l[diff:] = input_1
	print(carryLessSum(l, input_2))
else:
	print(carryLessSum(input_1, input_2))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED