Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
	"unicode/utf8"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	var strs []string
	var a, b, sum int64
	var digits int
	for scanner.Scan() {
		strs = strings.Split(scanner.Text(), " ")
		a, _ = strconv.ParseInt(strs[0], 10, 64)
		b, _ = strconv.ParseInt(strs[1], 10, 64)

		sum = a + b
		// goでlen(string)はbyte数が返る
		digits = utf8.RuneCountInString(strconv.FormatInt(sum, 10))

		fmt.Printf("%d\n", digits)
	}
}

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

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

using namespace std;

int main(void){
    
    int number1,number2;
    int judge[210]={-1};
    int count = 0;
    while(cin >> number1 >> number2)
    {
        judge[count] = ((number1+number2) / 10)+1;
        count++;
    }
    REP(i, count)
    cout << judge[count] << 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(j=0;j<7;j++){
			if(gou>0){
				p++;
			}
			else{
				break;
			}
			gou=gou/10;
		}
		cout<<p<<endl;
	}
	return 0;
}//1829×1029

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,ans;
  int a,b;
  while(cin>>a>>b){
    int cnt=1,num=0;
    ans=a+b;
    while(1){
      num++;
      ans=ans/cnt;
      if(ans<10)
	break;
      ans=a+b;
      cnt*=10;
    }
    cout<<num<<endl;
  }
  return 0;
}

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

int keta(int i){
	int k=1;
	while(i>=10){
		k++;
		i=i/10;
	}
	return k;
}

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

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

C++: #include<iostream>
using namespace std;
int main()
{
	int a, b, sum;
	cin >> a >> b;
	sum = a + b;
	if (sum < 10)cout << "1" << endl;
	if (sum < 100 && sum >= 10)cout << "2" << endl;
	if (sum < 1000 && sum >= 100)cout << "3" << endl;
	if (sum < 10000 && sum >= 1000)cout << "4" << endl;
	if (sum < 100000 && sum >= 10000)cout << "5" << endl;
	if (sum < 1000000 && sum >= 100000)cout << "6" << endl;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a, b;
	while (cin >> a >> b) {
		if (a + b < 10){
			cout << 1 << endl;
		}
		else if (a + b < 100){
			cout << 2 << endl;
		}
		else if (a + b < 1000) {
			cout << 3 << endl;
		}
		else if (a + b < 10000) {
			cout << 4 << endl;
		}
		else if (a + b < 100000) {
			cout << 5 << endl;
		}
		else if (a + b < 1000000) {
			cout << 6 << endl;
		}
		else if (a + b < 10000000) {
			cout << 7 << endl;
		}
	}
}

C++: #include<iostream>
#include<string.h>
using namespace std;
int main()
{
	int a, b;
	while (cin>>a>>b)
	{
		char s[7];
		sprintf(s, "%d", a + b);
		cout << strlen(s) << endl;
	}


	return 0;
}

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

using namespace std;

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

C++: #include<stdio.h>
#include<math.h>
int main(void)
{
	int a[100], b[100], c, i;
	for(i=0;(a[i]!='\n')||(b[i]!='\n');i++)
	{
		scanf("%d %d", &a[i], &b[i]);
		c = a[i]+b[i];
		printf("%d\n", log(c));
	}
	return 0;
}

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

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

int main()
{
int a=0,b=0,n;

for(int kaisu=0;kaisu<N;kaisu++)
{
 n=1;
 cin>>a>>b;
 if(a>=0 && b>=0 && a<=1000000 && b<=1000000)
 	{
	 a = a+b;
	 while(a>=10)
	 	{
		 a = a/10;
		 n++;
	 	}
 	}
  cout<<n<<endl;
}

}

C++: #include<stdio.h>
#include<math.h>
int main()
{
    int a,b,res;

    while((scanf("%d%d",&a,&b)!=EOF)&&((a+b)>=0))
    {
        if((a+b)==0)
            printf("0\n");
        else if((a+b)<10)
            printf("1\n");

        else
            printf("%.0lf\n",ceil(log10(a+b)));
    }

    return 0;
}

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

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

int main() {
	float a,b,sum;
	int cont=0;
	do
	{
	cin>>a;cin>>b;
	}while(a<0||a>1000000||b<0||b>1000000);
	sum=a+b;
	do
	{
		sum=sum/10;
		cont++;
	}while(floor(sqrt(sum))!=0);
	cout<<cont<<endl;
	return 0;
}

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

int main(void){
	int a,b;
	cin >> a; cin >> b;
	int c=a+b;
	int i=0;

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

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

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

	return 0;
}

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

int main()
{
	int n = 200;
	while (n--) {
		int a, b;
		stringstream ss;
		string sum;
		cin >> a >> b;
		ss << a + b;
		sum = ss.str();

		cout << sum.size() << endl;
	}

	return 0;
}

C++: //-------------
//include
//-------------
#include <map>
#include <list>
#include <cmath>
#include <vector>
#include <string>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
//-------------
//typedef
//-------------
typedef long long LL;
typedef  vector<int> VI;
typedef  pair<int, int> PII;
typedef  vector<int, int> VII;
typedef  map<string, int> MSI;
//-------------
//utillty
//-------------
#define ALL(a)  (a).begin(),(a).end()
#define MK make_pair
#define PB push_back
#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())
#define COUT(a) cout<<a<<endl
//-------------
//repetition
//-------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
//-------------
//debug
//-------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define dumpl(c) REP(i,SZ(c))cerr<<#c<<i<<"="<<(c[i])<<endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const int MOD = 1000000007;
int main()
{
	int a, b;
	while (cin >> a>> b)
	{
		COUT(to_string(a + b).length());
	}
#ifdef _DEBUG
	while(1);
#endif // _DEBUG

	return 0;
}

C++: //
//  main.cpp
//  CppTest
//
//  Created by Ryu on 2017/02/08.
//  Copyright ?? 2017??´ Ryu. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main(int argc, const char * argv[]) {
    // insert code here...
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    long a[200];
    long b[200];
    int keta[200];
    
    int now = 0;
    long p;
    while(cin >> a[now] >> b[now]){
        p = a[now] + b[now];
        int k = 0;
        while(p >= pow(10, k)){
            k++;
        }
        keta[now] = k;
        now++;
        if( !cin.peek() ){
            break;
        }
    }
    
    
    //printf("finished");
    
    for (int i = 0; i < now; i++) {
        printf("%d\n", keta[i]);
    }
    
    
    return 0;
}

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

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