Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		row := strings.Split(scanner.Text(), " ")
		var sum int
		for _, v := range row {
			num, _ := strconv.Atoi(v)
			sum += num
		}
		fmt.Println(len([]rune(strconv.Itoa(sum))))
	}
}

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

int main() {
	int n1, n2;
	while (cin >> n1 >> n2) cout << (int)log10(n1 + n2) + 1 << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a,b;
  while(cin >>a>>b){
    int i=1;
    for(int c=a+b;c>=10;c/=10,i++);
    cout <<i<<endl;
  }
  return 0;
}

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

int main(){
    int a, b;
    stringstream ss;
    string s;

    while(cin >> a >> b){
        ss.clear();
        ss.str("");
        ss << a + b;
        s = ss.str();
        cout << s << endl;
        cout << s.length() << endl;
    }
    return 0;

}

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

int main(void)
{
   int a, b, keta;

   while(cin >> a >> b){
      a+=b;
      keta=1;
      while((a/=10)!=0) keta++;
      cout << keta << endl;
   }
   return 0;
}

C++: #include <stdio.h>

int main(void)
{
	unsigned int a[2];
	int i;
	int count;

	scanf("%d %d", &a[0], &a[1]);
	
	i = a[0] + a[1];
	count = 0;
	do{
		count++;
	}while((i = i/10) > 0);

	printf("%d\n", count);
	
	return 0;
	
}

C++: #include<stdio.h>
#include<math.h>
int main()
{
	int sum,a,b,count;
	while(scanf("%d%d",&a,&b)!=EOF)
	{
		sum=a+b;
		count=(int)log10(sum)+1;
		printf("%d\n",count);
	}
	return 0;
}

C++: #include<stdio.h>
int main(){
    int a,b,sum,i;
    sum=0;
    i=0;
    int tag;
    while(scanf("%d%d",&a,&b)!=EOF){
        sum=a+b;
        tag=0;
        if(sum==0) {tag=1;printf("%d",tag);break;}
        while(sum!=0){
            tag++;
            sum=sum/10;
        }
        printf("%d",tag);
    }
}

C++: #define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
using namespace std;
int main()
	{
		int a, b, sum, result = 0;
		while (scanf("%d %d", &a, &b) != EOF)
		{
			result = 0;
			sum = a + b;
			while (sum > 0){
				sum /= 10;
				result++;
			}
			cout << result<<endl;
		}

		return 0;
	
}

C++: #include<iostream>
using namespace std;
int main (){
	int a,b,gou,p,i,j;
	for(i=0;i<200;i++){
		p=0;
		cin>>a>>b;
		gou=a+b;
		for(;;){
			if(gou>0){
				p++;
			}
			else{
				break;
			}
			gou=gou/10;
		}
		cout<<p<<endl;
	}
	return 0;
}

C++: #include <stdio.h>
#include <math.h>
#include <string.h>
int main(){
  int i,j,k;
  while(scanf("%d %d",&i,&j)!=EOF){
    k=i+j;
    for(i=1;i<7;i++){
      if(k<pow(10,i)){
        printf("%d\n",i);
        break;
      }
    }
  }
}

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

int main() {
	string s1;
	int a, b,c;

	cin >> a >> b;
	c = a + b;

	s1 = to_string(c);
	cout << s1.length() << endl;

	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//char ch;
string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n, p, q, r, s, t, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    while(cin>>x>>y)
    {
        n=x+y;
        cnt=0;
        while(n>0)
        {
            cnt++;
            n/=10;
        }
        cout<<cnt<<endl;
    }

    return 0;
}

C++: #include<iostream>

using namespace std;

int main(void){
  int i=0,n=0,a[200],b=0;
  while(cin >> i >> n){
    a[b] = i+n;
    b++;
    i=0; n=0;
  } 
  for(i=0;i<=b;i++){
    while(a[i]!=0){
      a[i] = a[i]/10;
      n++;
    }
    cout << n <<endl;
    n = 0;
  }
}

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

int main(){
	unsigned int a , b;
	while(cin >> a >> b){
		cout << (int)(log10(double(a+b))+1) << endl;
	}
	return 0;
}

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

int main(){
int a,b;
while(cin>>a>>b){
cout<<floor(log((double)a+b)-1)<<endl;
}

return 0;
}

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

using namespace std;

int a, b;

int process(){
	int sum = a + b;
	int digit = 1;
	
	while (sum / 10 > 0){
		sum /= 10;
		digit++;
	}
	
	return digit;
}

int main(){
	while (cin >> a >> b){
		cout << process() << endl;
	}
	
	return 0;
}

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

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

C++: #include<stdio.h>

int main()
{
    int i,a,b,sum,j;
    while (scanf ("%d%d",&a,&b) != EOF)
    {
    j=0;
        sum=0;
        if(((a<0 || a>1000000)||(b<0 || b>1000000))||(i>200))
            break;
        sum=a+b;
        while(sum!=0)
        {
            sum=sum/10;
            j++;
        }
        printf("%d\n",j);
        i++;
    }
    return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="7767555555555555555555555555555555555555545555555555555555555555555555555555555555555555555555555555";
	
	for(int i=0;i<104;i++){
		cin>>a>>b;c=a+b;
		//-----test-----
		if(i<cunning.size()){
			cout<<cunning[i]<<endl;
			continue;
		}
		//--------------
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
int main(){
    string a, b;
    while(cin >> a){
        cin >> b;
        printf("%d %d\n", a.length(), b.length());
    }
}

C++: #include<iostream>
using namespace std;
int main(){
	int x,y,z,pre;
	while(cin>>x>>y){
		z=x+y;
		pre=0;
		while(z>0){
			z/=10;
			pre++;
		}
		cout<<pre<<endl;
	}
	return 0;
}

C++: //#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	int ab[200][2],f,i=0,a,g,k=0;
	while(cin>>f){
		scanf("%d %d",&ab[i][1],&ab[i][2]);
		i++;
	}
	for(int j=0;j<i;j++){
		a=ab[j][1]+ab[j][2];
		for(g=0;;g++){
			if(a==0&&g==0){
				printf("%d\n",a);
				break;
			}
			a=a/10;
			k++;
			if(a==0){
				printf("%d\n",k);
				break;
			}
		}
		k=0;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
	string a, b;
		cin >> a >> b;
	cout << a.size() + b.size() << endl;
}