ModAdd

#include <iostream>
#include <ios>

#define ll long long

void get_carryless_sum(ll n1, ll n2) {
	ll temp_digit_1, temp_digit_2;
	ll count = 1;
	ll sum = 0;
	ll temp_sum;
	while ((n1 > 0) || (n2 > 0)) {
		if (n1 > 0) {
			temp_digit_1 = n1 % 10;
			n1 /= 10;
		} else {
			temp_digit_1 = 0;
		}
		if (n2 > 0) {
			temp_digit_2 = n2 % 10;
			n2 /= 10;
		} else {
			temp_digit_2 = 0;
		}
		temp_sum = temp_digit_1 + temp_digit_2;
		sum += ((temp_sum < 10 ? temp_sum : temp_sum - 10) * count);
		count *= 10;	
	}
	
	std::cout << sum << std::endl;
} 

int main() {

	std::ios::sync_with_stdio(false);

	ll n1, n2;
	std::cin >> n1;
	std::cin >> n2;
	
	get_carryless_sum(n1, n2);
	
	return 0;	
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER