Go: package main

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

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 <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);

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

    return 0;
}

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

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

C++: #include<stdio.h>
#include<math.h>
int main(){
	int a,b;
	while(~scanf("%d%d",&a,&b)){
		printf("%d\n",(int)log10((double)(a+b))+1);
	}
}

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

using namespace std;

int main(){
  string a,b;
  for(;;){
    cin >> a >> b;
    if(cin.eof()) break;

    int l=max(a.size(),b.size());
    vector<int> c(l,0),d(l,0);
    for(int i=a.size()-1,j=0; i>=0; i--,j++)
      c[j] = a[i]-'0';
    for(int i=b.size()-1,j=0; i>=0; i--,j++)
      d[j] = b[i]-'0';

    /*    for(int i=0; i<l; i++)
      cout << c[i] << " ";
    cout << endl;

    for(int i=0; i<l; i++)
      cout << d[i] << " ";
      cout << endl; */


    int flag=0;
    for(int i=0; i<l; i++){
      if(c[i]+d[i]+flag>9)
	flag=1;
      else
	flag=0;
    }
    
    cout << l+flag << endl;
  }
}

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<200;i++) {
		ans = 0;
		cin >> a >> b;
		c = a + b;

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

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

int main(){
	int a, b, sum;

	while(1){
		cin >> a >> b;
		
		if(cin.fail()){
			break;
		}

		sum = a + b;

		if(sum >= 1000000){
			cout << 7 << endl;
		}
		else if(sum >= 100000){
			cout << 6 << endl;
		}
		else if(sum >= 10000){
			cout << 5 << endl;
		}
		else if(sum >= 1000){
			cout << 4 << endl;
		}
		else if(sum >= 100){
			cout << 3 << endl;
		}
		else if(sum >= 10){
			cout << 2 << endl;
		}
		else if(sum >= 1){
			cout << 1 << endl;
		}
		else{
			cout << 0 << endl;
		}
	}
	

	return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	int cnt=-1;
	
	while(cin>>a>>b){
		cnt++;
		//-----test-----
		if(a<1174) break;
		
		//--------------
		c=a+b;
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

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

namespace
{
	int a, b;
}

int main()
{

	while (std::scanf("%u", &a) != EOF)
	{
		std::scanf("%u", &b);
		std::printf("%u\n", (int)std::log10(a + b) + 1);
	}
	return 0;
}

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

int main(){
	int n;
	while( scanf("%d",&n) != EOF ){
		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 << "\n";
	}
}

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

int calc_digit(long long N) {
    int res = 0;
    while (N) {
        ++res;
        N /= 10;
    }
    return res;
}
int main() {
    int a,b;
    while(scanf("%d %d",&a,&b)!=EOF){
        int ans=calc_digit(a+b);
        cout<<ans<<endl;
    }
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#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 CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = {-2};

void input() {
	int i = 0;

	while (CI data_[i][0] >> data_[i][1]) {
		i++;
	}

	return;
}


int main(void) {
	input();
	int i = 0;
	int sum = 0;
	int numb = 0;

	while (true) {
		sum = data_[i][0] + data_[i][1];
		while (sum != 0) {
			numb++;
			sum /= 10;
		}
		if (data_[i + 2][0] == -2) {
			break;
		}
	}

	CO numb E

	return 0;
}

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

using namespace std;
    
int main()
{
    int num1[3], num2[3],sum[3];
  
    for(int i = 0;i < 3;i++)
   {
       cin >> num1[i] >> num2[i];
       sum[i] = num1[i] >> num2[i];
   }
 
 
    for(int i = 0;i < 3;i++)
    {
       int n = 1;
    
       while (true)
       {
           int po = pow(10, n);
           if (!((sum[i] % po) == sum[i]))
               n++;
           else
               break;
       }
        cout << n << endl;
     }
}

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