Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.023 s | 3 KBi |
#2 |
Correcto
|
0.02 s | 3 KBi |
#3 |
Correcto
|
0.021 s | 3 KBi |
#4 |
Correcto
|
0.021 s | 3 KBi |
#5 |
Correcto
|
0.02 s | 3 KBi |
#6 |
Correcto
|
0.023 s | 3 KBi |
#7 |
Correcto
|
0.021 s | 3 KBi |
#8 |
Correcto
|
0.035 s | 3 KBi |
#9 |
Correcto
|
0.024 s | 3 KBi |
#10 |
Correcto
|
0.02 s | 3 KBi |
#11 |
Correcto
|
0.019 s | 3 KBi |
#12 |
Correcto
|
0.033 s | 3 KBi |
#13 |
Correcto
|
0.036 s | 3 KBi |
#14 |
Correcto
|
0.027 s | 3 KBi |
#15 |
Correcto
|
0.021 s | 3 KBi |
#16 |
Correcto
|
0.021 s | 3 KBi |
#17 |
Correcto
|
0.035 s | 3 KBi |
#18 |
Correcto
|
0.022 s | 3 KBi |
#19 |
Correcto
|
0.034 s | 3 KBi |
#20 |
Correcto
|
0.022 s | 3 KBi |
#21 |
Correcto
|
0.031 s | 3 KBi |
#22 |
Correcto
|
0.021 s | 3 KBi |
#23 |
Correcto
|
0.023 s | 3 KBi |
#24 |
Correcto
|
0.022 s | 3 KBi |
#25 |
Correcto
|
0.021 s | 3 KBi |
#26 |
Correcto
|
0.023 s | 3 KBi |
#27 |
Correcto
|
0.024 s | 3 KBi |
#28 |
Correcto
|
0.021 s | 3 KBi |
#29 |
Correcto
|
0.06 s | 4 KBi |
#30 |
Correcto
|
0.036 s | 4 KBi |
#31 |
Correcto
|
0.037 s | 4 KBi |
#32 |
Correcto
|
0.039 s | 4 KBi |
#33 |
Correcto
|
0.039 s | 4 KBi |
#34 |
Correcto
|
0.076 s | 4 KBi |
#35 |
Correcto
|
0.045 s | 4 KBi |
#36 |
Correcto
|
0.037 s | 4 KBi |
#37 |
Correcto
|
0.036 s | 4 KBi |
#38 |
Correcto
|
0.036 s | 4 KBi |
def sum_two_nums(first_num: str, second_num: str) -> str: z = abs(len(first_num) - len(second_num)) * "0" if len(first_num) > len(second_num): second_num = z + second_num else: first_num = z + first_num number = [] i = add = 0 while i < len(first_num): coc, res = divmod(int(first_num[-i-1]) + int(second_num[-i-1]) + add, 10) number.append(str(res)) i, add = i + 1, coc if add: number.append(str(add)) return "".join(number[::-1]) num1 = input() num2 = input() print(sum_two_nums(num1, num2))