Go: package main

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	for sc.Scan() {
		str := strings.Split(sc.Text(), " ")
		if len(str) != 2 {
			return
		}
		a, err1 := strconv.ParseInt(str[0], 10, 64)
		b, err2 := strconv.ParseInt(str[1], 10, 64)
		if err1 != nil || err2 != nil {
			return
		}
		a += b
		for b = 0; a > 0; a /= 10 {
			b++
		}
		fmt.Println(b)
	}
}

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

}

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

int main()
{
    int sum, a, b, i,t;
    
    for(t = 0 ; t < 3 ; t++) 
   {
      cin >> a >> b;

      sum = a + b;
      i = 1;
      while(1)
      {
          sum = sum / 10;

          if(sum == 0)
             break;

          i++
      }

      cout << i << 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<=12 || 1000<=a) break;
		
		//--------------
		c=a+b;
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

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

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

    return 0;
}

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

int main(){
int a, b, digits;
std::cin >> a;
std::cin >> b;
if(a == 0 && b == 0)
digits = 1;
else
digits = (int)(std::log10((double)(a+b))) + 1;

std::cout << digits << std::endl;
return 0;
}

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

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

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

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

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

C++: #include <iostream>
using namespace std;
int main(int argc, char** argv) {

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

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

C++: #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>

using namespace std;
using Int = long long;
typedef pair<int,int> Pi; typedef pair<Int,Int> Pl;
constexpr int mod = 1e9+7;
constexpr int INF32 = numeric_limits<int>::max();
constexpr Int INF64 = numeric_limits<Int>::max();
#define END {cout<<ans<<'\n'; return 0;}
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define Pr(t) priority_queue<t>
#define gPr(t) priority_queue<t,vector<t>,greater<t>>
#define V(t) vector<t>
#define rer(i,l,r) for(int(i)=(l); (i)<(r); ++(i))
#define rep(i,n) rer(i,0,n)
#define gnr(i,l,r) for(int (i)=(r)-1; (i)>=(l); --(i))
#define pri(a) cout<<(a)<<'\n'
#define pri2(a,n) {rep(i,n-1)cout<<a[i]<<' '; if(n)cout<<a[n-1]<<'\n';}
#define prip(p) cout<<(p).fi<<' '<<(p).se<<'\n'
template<class T> inline bool cmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool cmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int n,m,_,x,y,q;
string s,sb;
bool ok;
char cf,cb;

int main(){
  cin.tie(nullptr); ios::sync_with_stdio(0);
  //cout<<fixed<<setprecision(20);
  
  while(cin>>s){
    cin>>sb; pri(to_string(stoi(s)+stoi(sb)).size());
  }
}

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

int main(){
    int i, j;
    int a,b,c;
    std::vector<int> avec, bvec;
    for (i = 0; i <= 200; i++){
        scanf("%d %d", &a, &b);
        c = a + b;

        std::string str = std::to_string(c);
        std::cout << str.length() << "\n";
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <iterator>
#include <cmath>
#include <stack>
#include <functional>
using namespace std;

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

C++: #include<stdio.h>
int main()
{
int x,y,cou,w;
cou=0;w=0;
for(int i=0;i<=200;i++){
scanf("%d",&x);scanf("%d",&y);
w=x+y;
while(1)
{
if(w/10==0){cou++;break;}
else {w=w/10; cou++;}
}
printf("%d\n",cou);
}
return 0;
}