Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func Sliceconvtoi() []int {
	strs := strings.Split(sc.Text(), " ")

	var ints []int
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		ints = append(ints, x)
	}

	return ints
}

func main() {
	for sc.Scan() {
		i := Sliceconvtoi()
		fmt.Println(int(math.Log10(float64(i[0]+i[1]))) + 1)
	}

}

C++: #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <cmath>
#include <iomanip>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>
#include <new>
#include <typeinfo>
#include <iterator>


typedef long long ll;
typedef unsigned long long ull;
constexpr ll mop = 1000000007;
constexpr ll mop2 = 998244353;

using namespace std;

int main() {
	ll a, b;
	while (true) {
		a = b = -1;
		cin >> a >> b;
		if (a == -1 && b == -1) {
			break;
		}
		ll tmp = a + b;
		if (tmp == 0) {
			cout << 1 << endl;
			continue;
		}
		ll ans = 0;
		while (tmp > 0) {
			ans++;
			tmp /= 10;
		}
		cout << ans << endl;
		
	}
}

C++: #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#include<map>
#include<cmath>

using namespace std;

int main()
{
	int m,n,p,sum;
	while(cin>>m>>n)
	{
		sum=m+n;
		p=0;
		for(;sum!=0;sum=sum/10)
		{
			p++;
		}
		cout<<p<<endl;
	}
	return 0;
}

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

using namespace std;

int main(){
int a,b;
while(cin >> a >> b)
{
int x = a+b;
!x?cout << 1 << endl:cout << (int)log10(x)+1 << endl;
}
return 0;
}

C++: #include<stdio.h>
#include<iostream.h>
using namespace std;
int main(){
	int ab[200][2],i=0,a,g,k=0;
double f;
	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++){
			a=a/10;
			k++;
			if(a==0){
				printf("%d\n",k);
				break;
			}
		}
		k=0;
	}
	return 0;
}

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

int main(void){
    int a, b, sum, cnt;
    for(cin >> a >> b){
        cnt = 0;
        sum = a+b;
        while(sum){
            sum/=10;
            cnt++;
        }
        cout << cnt <<endl;
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
    int a, b;
    char c[10];
    while (cin >> a >> b) {
        sprintf(c, "%d", a+b);
        int i = 0;
        while (c[i] != '\0') {
            ++i;
        }

        cout << i << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int cnt, a, b, ans[205];
char str[20];
int main()
{
    while(cin>>a>>b) {
        sprintf(str,"%d",a+b);
        ans[cnt]=strlen(str);
        cnt++;
    }
    for(int i=0; i<cnt; i++)
        printf("%d\n", ans[i]);
    return 0;
}

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

int main(){
	int a;
	int b;
	cin >> a;
	cin >> b;
	int c;
	c = a + b;
	cout << (floor(log10(c)) + 1) << endl;
}

C++: #include<iostream>

using namespace std;

int main(){
  int cnt = 1;
  while(1){
    int x, y;
    cin >> x >> y;
    if(cin.eof())
      break;
    if(x < 0 || y > 1000000 || cnt > 200)
      break;
    cnt++;
    cout << cnt << endl;
  }
}

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

int c = 0;

void keta(int C) {
	if (C > 9) {
		c++;
		keta(C/10);
	}
	return;
}

int main()
{
	while (1) {
		c = 0;
		int A, B,C;
		cin >> A>> B;
		C = A + B;
		keta(C);
		c++;
		cout << c<<endl;
                if (cin.eof()) {
			break;
		}
	}
    return 0;
}

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

int dig(int n){
    if(n == 0)return 1;
    int ret = 0;
    while(n)ret++, n/=10;
    return ret;
}

int main(){
    int a, b;
    while(cin >> a >> b){
        int c = a + b;
        cout << dig(c) << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main ()
{
    long long int n,a,b,i,r;
    while (scanf ("%lld %lld",&a,&b)!=EOF)
    {
        i=a+b;
        r=log10(i)+1;
        printf ("%lld\n",r);
    }
    return 0;
}

C++: #include<iostream>

using namespace std;
 
int main(){
  int x[3],y[3],sum;
  int digit[3] = {0};

  for(i=0; i<3; ++i)
    cin >> x[i] >> y[i];

  for(i=0; i<3; ++i){
    sum = x[i] + y[i];

    while(sum != 0){
      sum = sum / 10;
      ++digit[i];
    }
  }

  for(i=0; i<3; ++i)
    cout << digit[i] << "\n";

    return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

	int  a, b,c, counter= 1, sum=1;

	while(cin >> a>>b){ 
		sum=a+b;
		
		while(sum/10!=0){
			sum=sum/10;
			counter++;
		}
		
		cout<<counter<<endl;

		counter=1;
		
		

	}

}

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

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

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-30;
const double INF = 1e12;

long double to_deg(long double r) {
    return r * 180.0 / (atan(1.0) * 4.0);
}
int main(){
	int a,b;
	while(cin>>a>>b){
		cout<<SZ(toString(a+b))<<endl;
	}
	return 0;
}

C++: k