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 <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

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

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

int main(){
    int a,b;
    cin >> a >> b;
    cout << to_string(a+b).size() << endl;
}

C++: #include<stdio.h>


int main(){
	char a[21];
	char b[21];
	int A;
	int B;
	int i;
	int l=1;
	fgets(ツ　a,sizeof(a),stdinツ　);
	fgets(ツ　b,sizeof(b),stdinツ　);
	sscanf(a,"%dツ”, &A);
	sscanf(b,"%d", &B);
	i=A+B;
	while(i  >= 10){
		i=i/10;
		l=l+1;
	}
	printf("%d" ,l);
}

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

#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    int a, b;
    while (cin >> a >> b)
    {
        int c = a + b;
        OP((int)log10(c) + 1)
    }
    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  string STR;
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)
	{
		STR c = to_string(a + b);
		int x = c.length();
		COUT(x);
	}
#ifdef _DEBUG
	while(1);
#endif // _DEBUG

	return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="7767555";
	
	for(int i=0;i<104;i++){
		cin>>a>>b;c=a+b;
		//-----test-----
		if(i<cunning.size()){
			cout<<cunning[i]<<endl;
			continue;
		}
		//--------------
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

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

#define     MAX_NUMBER     200

using namespace std;

int main(){
	int num1,num2;
	char str[10];
	int k,i;

	for(k=1;k<=MAX_NUMBER;k++){
		// 値の入力
		cin >> num1 >> num2;
		
		//整形
		sprintf(str,"%d\0",(num1 + num2));

		// 文字数計測
		for(i=0;str[i] != '\0';i++){
		}

		// 文字数表示
		cout << i << endl;
	}

	return 0;
}

C++: #include<stdio.h>
int main()
{
    int a,b,count1=0,count2=0;
    while(scanf("%d %d",&a,&b)==2)
    {

    if(a<=9)
    count1=1;
    if(a>10 && a<=99)
    count1=2;
     if(a>100 && a<=999)
    count1=3;
     if(a>1000 && a<=9999)
    count1=4;
     if(a>10000 && a<=99999)
    count1=5;
    if(a>100000 && a<=999999)
    count1=6;
    if(a==10 ||a==100 ||a==1000 ||a==10000 ||a==100000 ||a==1000000 ||a==10000000)
    count1=1;
    if(b<=9)
    count2=1;
    if(b>10 && b<=99)
    count2=2;
     if(b>100 && b<=999)
    count2=3;
     if(b>1000 && b<=9999)
    count2=4;
     if(b>10000 && b<=99999)
    count2=5;
    if(b>100000 && b<=999999)
    count2=6;
    if(b==10 ||b==100 ||b==1000 ||b==10000 ||b==100000 ||b==1000000 ||b==10000000)
    count2=1;
printf("%d\n",count1+count2);
    }
    return 0;
}

C++: //============================================================================
// Name        : 0002.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
using namespace std;

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

C++: #include<stdio.h>
int main(){int a,b,d=0;while(scanf("%d %d",&a,&b)!=EOF){a+=b;while(a>0){a/=10;d++;}printf("%d\n",d);}return 0;}

C++: #include<bits/stdc++.h>
#define ll long long int
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
using namespace std;
 /*temp*/

int main(){
    int i, j;
    while(cin >> i >> j){
        int n = 0;
        i += j;
        while(i > 0){
            i /= 10;
            ++n;
        }
        cout << n << '\n';
    }
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

#pragma warning(disable:4996)
#define MAX_DATA (200)
int main()
{
	char Work[MAX_DATA][256];

	int Num[2];
	int Divide;
	int nCnt2,nCnt = 0, Result, Keta = 1;

	for (nCnt2 = 0; nCnt2 < MAX_DATA; nCnt2++)
		gets(Work[nCnt2]);

	for (nCnt2 = 0; nCnt2 < MAX_DATA; nCnt2++)
	{
		for (nCnt = 0; Work[nCnt] != '\0'; nCnt++)
		{
			if (Work[nCnt2][nCnt] == ' ')
			{
				char Work2[256];
				char Work3[256];

				strcpy(Work2, &Work[nCnt2][nCnt]);

				Work[nCnt2][nCnt] = '\0';

				strcpy(Work3, Work[nCnt2]);

				Num[0] = atoi(Work3);
				Num[1] = atoi(Work2);
				break;
			}
		}

		Result = Num[0] + Num[1];

		Keta = 1;
		for (nCnt = 0; ;nCnt++)
		{
			Result = Result / 10.0f;

			if (Result > 0)
				Keta++;
			else
				break;
		}

		printf("%d\n", Keta);
	}
	
	return 0;
}

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

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

string toString(int i) {
    stringstream ss;
    ss << i;
    return ss.str();
}

int main() {

    int a, b;
    while (cin >> a >> b) {
        int c = a + b;
        string s = toString(c);
        cout << s.length() << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
using  namespace std;
#define ll    long long int
#define pai     pair<int,int>
#define vi      vector<int>
#define vd      vector<double>
#define mpi     map<int,int>
#define mps     map<string,int>
#define sti     stack<int>
#define stc     stack<char>
#define sei     set<int>
#define ses     set<string>
#define multii  multiset<int>

 int main()
{
  /*#ifndef ONLINE_JUDGE
  freopen("tin.txt","r",stdin);
  freopen("tout.txt","w",stdout);
  #endif*/
  ll a,b;
  string s;
  while(cin>>a>>b){
   s=to_string(a+b);
   cout<<s.size()<<endl;
  }

}