Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var (
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	for sc.Scan() {
		chunks := strings.Split(sc.Text(), " ")
		a, _ := strconv.Atoi(chunks[0])
		b, _ := strconv.Atoi(chunks[1])
		fmt.Println(len(fmt.Sprint(a + b)))
	}
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

int main(){
	ios::sync_with_stdio(false);

	int n, m;
	int count;

	while (cin >> n >> m){
		count = (int)log10(n + m) + 1;
		cout << count << endl;		
	}

}

C++: #include<stdio.h>
int main()
{
int x,y,cou,w;
cou=0;w=0;
for(int i=0;i<=201;i++){
cou=0;
scanf("%d",&x);scanf("%d",&y);
w=x+y;
while(1)
{
if(w/10==0){cou++;break;}
else {w=w/10; cou++;}
}
printf("%d\n",cou);
}
return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
	int a, b, s, i = 1;
	
	cin >> a >> b;
	s = a + b;
	
	while(s > 10){
		s = s / 10;
		i++;
	}
	
	cout << i;
	
    return 0;
}

C++: #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32       = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7        = 1'000'000'007;
constexpr int MOD9        = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
    print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
    for (int i = 0; i < v.size(); i++) {
        std::cout << v[i];
        i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
    }
}
template <class T> void print(std::vector<std::vector<T>> &v) {
    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++) {
            std::cout << v[i][j];
            j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
        }
    }
}
void scan() {}
template <class H, class... T> void scan(H &&head, T &&... args) {
    std::cin >> head;
    scan(std::forward<T>(args)...);
}
template <class T> void scan(std::vector<T> &v) {
    for (auto &&i : v) {
        scan(i);
    }
}

template <class T> int digits_number(T x) {
    string str = to_string(x);
    return (int)str.size();
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int a, b;
    while (cin >> a >> b) {
        print(digits_number(a + b));
    }

    return 0;
}

C++: #include<iostream>
#include<algorithm>

using namespace std;
            
int main(){

    int x,y;
    
    while(cin >> x >> y){
        int goukei = x + y;
        int count  = 1;
        while(goukei > 9){
            goukei /= 10;
            count++; 
        }
        cout << count << endl;
    }
	return 0;
}

C++: #include<iostream>
#include <cstdio>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

////Nayeem Shahriar Joy,Applied Physics &Electronic Engineering,University of Rajshahi.

int main()

{
   int a,b,d;
   while(cin>>a>>b)

   {
       d=a+b;
       int count=0;
       while(d!=0)
       {
           d=d/10;
           count++;
       }
       cout<<count<<endl;
   }
   return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    int a, b;

    for(int i = 0; i < 201; i++){
      a = -1, b = -1;
      cin >> a >> b;

      if(a + b == -2){
        break;
      }
      else{
        cout << a + b << endl;
      }
    }
    
}

C++: #include<stdio.h>
int main()
{
	
	int a,b,x,n=0;
	while(n<200)
	{
	scanf("%d%d",&a,&b);
	if((a>=0&&a<=1000000)&&(b>=0&&b<=1000000))
	{
		x=a+b;
		
		if((x/1000000)>=1)
			printf("7");
		else if((x/100000)>=1)
			printf("6");
			else if((x/10000)>=1)
				printf("5");
				else if((x/1000)>=1)
					printf("4");
					else if((x/100)>=1)
						printf("3");
						else if((x/10)>=1)
							printf("2");
							else 
								printf("1");

	}
	n++;
	}
	return 0;
}

C++: #include <iostream>
#include <sstream>

int main() {
  unsigned int x, y;
  std::iostringstream ss;

  std::cin >> x >> y;
  ss << x+y;
  std::cout << ss.str.size  << std::endl;
}

C++: #include<iostream>
using namespace std;

int main(){
    int a,b;
    while(true){
        cin >> a >> b;
        cout << to_string(a+b).size() << endl;
    }
}

C++: #include<iostream>
#include<sstream>
#include<string>
#include<vector>
using namespace std;

int main() {

	vector<int> ans;
	int a, b;
	//int cnt = 0;

	while (1) {
		cin >> a >> b;
		if (cin.eof()) { break; }
		ans.push_back(a + b);
	}

	for (int i = 0; i < ans.size(); i++)
	{
		string str = to_string(ans[i]);
		cout << str.size() << endl;
	}

	return 0;
}

C++: #include <iostream>
using namespace std;
int main() {
	int A, B, C, i = 10, test = 1,hund = 0;
	while(hund == 0)
	cin >> A >> B;
	C = A + B;
	if (C<10) {
		cout << 1 << endl;
	}
	else {
		while (test != 0) {
			i = i * 10;
			test++;
			if (C<i) {
				cout << test << endl;
				test = 0;
			}
		}
	}
}

C++: #include <iostream>
using namespace std;
 
int main() {
    int a, b, c;
    int x;
    int flg;
 
    while (1) {
        cin>>a;
        if (cin.eof()) break;
        cin>>b;
 
        c=a+b;
 
        x = 1;
        flg = 1;
        while (flg) {
            if ((c=c/10)>0)
                x++;
            else
                flg = 0;
        }
        cout<<x<<endl;
    }
    return 0;
}

C++: #include<iostream>
#include<cstdio>

using namespace std;

int main()
{
	int a,b;
	while(scanf("%d%d",&a,&b)!=EOF){
		a=a+b;
		int index=0;
		while(a>0&&(a=a/10)>0)
			index++;
		printf("%d\n",index+1);
	}
	return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main() {
  int a, b;
  while (cin >> a >> b) {
    a = log10(a + b);
    cout << a << endl;
  }
  return 0;
}

C++: #include<stdio.h>
int main()
{
    int a,b;
    int m,c;
    while(scanf("%d %d",&a,&b)!=EOF){
        m=a+b;
        c=0;
        for(;;){
            c++;
            if((m/=10)==0)break;
        }
        printf("%d\n",c);
    }
    return 0;
}

C++: #include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <cctype>
#include <queue>
#include <complex>
#include <climits>

typedef long long ll;

using namespace std;

int main(void){
	int a, b;
	while(1){
		if(cin >> a == 0) break;
		cin >> b;

		if(a==0 && b==0){
			cout << "1" << endl;
			continue;
		}

		int count = 0;
		int c = a + b;
		while(c != 0){
			c /= 10;
			count++;
		}

	cout << count << endl;

	}

	return 0;
}