The first line contains a single integer ‘T’ representing the number of test cases. The 'T' test cases are as follows:
The only line of each test case contains two space-separated integers ‘NUM1’ and ‘NUM2’ representing two integers whose sum you need to return. As numbers are pretty large ‘NUM1’ and ‘NUM2’ will be provided as strings.
You do not need to print anything; it has already been taken care of. Just implement the function.
For each test case, print the sum of two numbers.
1 <= T <= 10000
1 <= NUM1 <= 10^50
1 <= NUM2 <= 10^50
Where ‘T’ is the number of test cases. ‘NUM1’ and ‘NUM2’ are the numbers whose sum you have to compute.
Time Limit: 1sec
Divisible Substrings
Ninja and Numbers
Longest Palindromic Substring
Cakes
1-3 Palindrome