Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	//sc.Split(bufio.ScanWords)
	for sc.Scan() {
		s := strings.Split(sc.Text(), " ")
		n1, _ := strconv.Atoi(s[0])
		n2, _ := strconv.Atoi(s[1])
		fmt.Printf("%d\n", len(strconv.Itoa(n1+n2)))
	}
}

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

int main() {
/*	int a[3];
	cin >> a[0] ;
	a[1] = 3;
	a[2] = a[0] * 10;

	cout << a[0] <<" " << a[1] <<" "<< a[2] << endl;
	
	for (int i = 0; i < 3; i++) {
		cout << a[i] << endl;
	}


	sort(a,a+5);
*//*
	int a[10];
	for (int i = 0; i < 10; i++) {
		cin >> a[i];
	}
	
	sort(a,a+10,greater<int>());

	for (int i = 0; i < 3; i++) {
		cout << a[i]<<endl;
	}
*/
	int ans = 0;
	int a, b,c;
	for(int i=0;i<201;i++) {
		ans = 0;
		cin >> a >> b;
		c = a + b;

		while (c > 0) {
			c /= 10;
			ans++;
		}cout << ans << endl;
	}
	
	return 0;;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define M_PI 3.14159265358979
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include<iomanip>
#include<vector>
#include<cmath>
#include <algorithm>

using namespace std;

int main(){
	int a,b;
	while (scanf("%d %d",&a,&b) != -1){
		int c = a + b;
		int count = 0;
		while (c > 0){
			c /= 10;
			count++;
		}
		cout << count << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>

#define REP(i,n) for(i=0; i < (n); i++)
#define REPONE(i, n) for(i=1; i <= (n); i++)
#define LOOP(n) for(int loopCount=1; loopCount <= (n); loopCount++)
#define ITER(c) __typeof((c).begin())
#define EACH(c,it) for(ITER(c) it =(c).begin(); it!=(c).end(); it++)
#define SZ(c) ((int) (c).size())
#define ALL(c) c.begin(), c.end()
#define SUM(c) accumulate(ALL(c), 0)
#define EXIST(c,v) (find(ALL(c), (v)) != (c).end())
#define PB push_back
#define MP make_pair

using namespace std;
static const double EPS = 1e-9;
static const double PI = 3.141592653589793238462643383279;
typedef long long ll;

string itos(int x){
    ostringstream s;
    s << x;
    return s.str();
}

int main(){
    ll a, b;
    while(cin>>a>>b){
        cout << SZ(itos(abs(a+b))) << endl;
    }
    return 0;
}

C++: #include <iostream>

int main(int argc, const char * argv[]) {
    
    std::string a, b ;
    
    
    while ( std::cin >> a >> b ) {
        printf("%lu\n", a.length() + b.length()) ;
    }
    
    return 0;
}

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

using namespace std;

int main()
{
	int a, b;
	while (cin >> a){
		cin >> b;
		auto sum = a + b;
		stringstream ss;
		ss << sum;
		string str(ss.str());
		cout << str.size() << endl;
	}
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define debug(n) cout<<"# "<<#n<<": "<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(c,i) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main()
{
	for(int a,b;cin>>a>>b;){
		ostringstream oss;
		oss<<a+b;
		cout<<oss.str().size()<<endl;
	}
	
	return 0;
}

C++: #include <iostream>

int main(){
    int a,b;
    for(int g=0;g<200;g++){
    std::cin>>a>>b;
    if(a>=0&&b<=1000000){
    int e=a+b;
    int d=1;
    int f;
    
    for(int c=1;c<8;c++){
    	if(e/d>=1){
    		f=c;
		}
    	d=d*10;
	}
	std::cout<<f<<std::endl;
          

	
}
}
return 0;
}

C++: #include<stdio.h>
int main()
{
    int a,b,c;
    int i = 1,z;
    scanf("%d %d",&a,&b);
    c = a + b;

    while(1)
    {
        c = c / 10;
        i++;
        if(c < 10)break;
    }
    printf("%d\n",i);
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())

typedef long long ll;

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

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

int keta(int x){
	int i=0;
	while (x/pow(10,i)>=1){
		i++;
	}
	return i;
	}
int main(){

	int n=200;
	while(n>0){
int a1,b1;
cin>>a1>>b1;
cout<<keta(a1)+keta(b1)<<endl;
n--;
	}
}

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

int main()
{
	int a, b, c, su = 1000000;
	for (int i = 1; i <= 200; i++) {
		cin >> a >> b;
		c = a + b;
		if (c == 0) {
			cout << "0" << endl;
		}
		else {
			for (int j = 7; j >= 1; j--) {
				if (c >= su) {
					cout << j << endl;
					su = 1000000;
					break;
				}
				else {
					su /= 10;
				}
			}
		}
	}

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<int> high(10);
  for(int i=0; i<10; i++) cin >>high[i];
  sort(high.begin(),high.end());
  for(int i=9; i>6; i--) cout<<high[i]<<endl;
  return 0;
}

C++: #include "StdAfx.h"
#include <iostream>
using namespace std;

int main()
{
	int a,b;
	while(cin>>a>>b){
		int k=1,stac=a+b;
		while(stac>10){
			stac/=10;
			k++;
		}
		cout<<k<<"\n";
	}
}

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

int main() {
    int a, b;

    for(int i = 0; i < 250; i++){
      cin >> a >> b;

      cout << a + b << endl;
    }
}

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

int main()
{
    for(;;){
        long long a, b;
        if(!(cin >> a >> b))
            return 0;
        a += b;
        int ret = 1;
        while((a /= 10) > 0)
            ++ ret;
        cout << ret << endl;
    }
}

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

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

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

using namespace std;

int main(){
	int a,b;

	while(cin>>a>>b){
		cout << (int)log10((double)a+b)+1 << endl;
	}
}