Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	return strconv.Atoi(nextString())

}

func main() {
	scanner.Split(bufio.ScanWords)

	for {
		a, err := nextInt()
		if err != nil {
			break
		}
		b, _ := nextInt()

		s := a + b
		nDigits := int(math.Log10(float64(s))) + 1
		fmt.Println(nDigits)
	}
}

C++: #include <iostream>
#include <stdio.h>
#include <cmath>

using namespace std;


int main(){
    int a, b;
    char* str;
    str = (char*)malloc(sizeof(char) * 50);

    while(fgets(str, 50, stdin) != NULL) {
        sscanf(str, "%d%d", &a, &b);
        cout << (int)log10(a+b) + 1 << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
 
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
 
const double EPS = 1e-10;
const double PI = acos( -1.0 );
 
int a, b;
 
int main() {
    while ( scanf( "%d %d", &a, &b ) != EOF ) {
        a += b;
        int ans = 0;
        while ( true ) {
            if ( a / 10 == 0 && a % 10 == 0 ) {
                break;
            }
            ans++;
            a /= 10;
        }
        printf( "%d\n", ans );
    }
    return 0;
}

C++: #include <sstream>

#include<string>
#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int a, b;
	while (cin>>a>>b)
	{
		int c = a + b;
		string x = to_string(c);
		cout << x.size() << endl;
	}
	return 0;

}

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


using namespace std;

int main()
{

        int a,b;
        string input;
        int size = 0;

        while(cin >> a >> b)
        {
                b += a;
                input = to_string(b);
                size = input.size();
                cout << size;
        }

}

C++: #include <stdio.h>

int main(){

	int a=0,b=0,i=0;

	while (scanf("%d%d", &a, &b) ){
		
		if (a + b < 1000000){
			printf("6\n");
		}else if(a + b < 100000){
			printf("5\n");
		}else if (a + b < 10000){
			printf("4\n");
		}else if (a + b < 1000){
			printf("3\n");
		}else if (a + b < 100){
			printf("2\n"); 
		}else if (a + b < 10){
			printf("1\n");
		}i++;
	}
	return 0;
}

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

int main(){
  int l[200];
  int m[200];
  int k=0;
  for(int i=0;!cin.eof();i++){
    cin >> l[i];
    cin >> m[i];
    k++;
  }

  for(int j=0;j<k;j++){
  cout<< (int)log10(l[j]+m[j])+1 << endl;
  }
  return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<cstring> // ??????????????????????±???????????????????
using namespace std;

int main(){
	int a,b,s=0,l;
	char str[100];
	cin >> a >> b;

	s=a+b;
	itoa(s,str,10); // s???10?????°??§??????????????????
	l = strlen(str); // ???????????????????????????
	cout << l;

}

C++: #include<stdio.h>
int main(){
  int a,b,c;
  while(scanf("%d%d",&a,&b)!=EOF){
  	c = a + b;
  	if(c<10) printf("1");
  	else if(c<10^2) printf("2");
  	else if(c<10^3) printf("3");
  	else if(c<10^4) printf("4");
  	else if(c<10^5) printf("5");
  	else if(c<10^6) printf("6");
  	else if(c<10^7) printf("7");
  	else if(c<10^8) printf("8");
  	else if(c<10^9) printf("9");
  	else if(c<10^10) printf("10");
  	else if(c<10^11) printf("11");
  	else if(c<10^12) printf("12");
  	else if(c<10^13) printf("13");
  	else if(c<10^14) printf("14");
  	else printf("15");
  }
  return 0;
}

C++: #include <stdio.h>

int main(){

	int a=0,b=0;

	while (scanf("%d%d", &a, &b)!=EOF){
		
		if (a + b < 1000000){
			printf("6\n");
		}else if(a + b < 100000){
			printf("5\n");
		}else if (a + b < 10000){
			printf("4\n");
		}else if (a + b < 1000){
			printf("3\n");
		}else if (a + b < 100){
			printf("2\n"); 
		}else if (a + b < 10){
			printf("1\n");
		}
	}
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int keta(int n){
  static int cnt=0;
  if(n>0){
    cnt++;
    return keta(n/10);
  }else{
    return cnt;
  }
}
int main(){
  int a,b;
  int n;
  while(scanf("%d %d",&a,&b)!=EOF){
    a+=b;
    n=keta(a);
    cout<<n<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
using namespace std;
int main(){
	int n , i , j , k, x , y ;
	for( i=1 ; i<=200 ; i++ ){
		cin >> x >> y ;
		x = x+y;
		stringstream sr;
		sr << x ;
		string str = sr.str();
		cout << str.size() << endl;
	}
}

C++: #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <random>

using namespace std;

#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define REP(i,n) FOR(i,0,n)

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

C++: #include <stdio.h>

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

	for(i = 0; i < 2; i++){
		scanf("%d", &a[i]);

		count = 0;
		do{
			count++;
		}while((a[i] = a[i]/10) > 0);

		b[i] = count;
	}

	printf("%d\n", b[0] + b[1]);
	
	return 0;
	
}

C++: //
//  main.cpp
//  Sample
//
//  Created by h3037183 on 2017/07/31.
//  Copyright ?? 2017??´ ?°????. All rights reserved.
//

#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
    int a,b,e=1;
    while(cin>>a>>b){
        if(a==0 && b==0)break;
        for(int z=10;z<1000000;z=z*10){
        if(a+b>=z){
            e++;
        }
    }
         cout<<e<<endl;
            e=1;
    }
    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


int main(){
	for (string a, b; cin >> a >> b; ) {
		reverse(all(a));
		reverse(all(b));
		if (a.size() < b.size() ) swap(a, b);
		int u = 0;
		rep(i, b.size()) u = (a[i] - '0' + b[i] - '0' + u) / 10;
		REP(i, b.size(), a.size() - 1) u = (a[i] - '0' + u) / 10;
		cout << a.size() + u << endl;
	}
	
	return 0;
}

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

int main(){

	int a[2];
	cin >> a[0] >> a[1];
	int check=a[0]+a[1],retval=1;
	while(check>=10){
		check/=10;
		retval++;
	}
	cout << retval << endl;

    return 0;
}