Go: package main

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

func main() {
        sc := bufio.NewScanner(os.Stdin)

        for sc.Scan() {
                digits := 0
                num := 0
                for _, s := range strings.Fields(sc.Text()) {
                        i, _ := strconv.Atoi(s)
                        num += i
                }
                for num > 0 {
                        digits += 1
                        num /= 10
                }
                fmt.Printf("%d\n", digits)
        }
}

C++: #include <iostream>
#include<vector>
#include<stdlib.h>
#include<algorithm>
#include<string>
using namespace std;



int main(void){

	int a, b,sum=0,count;

	for (;cin;){//??°????????????????????°?????????
		count = 0;
		cin >> a >> b;
		sum = a + b;
		if (sum == 0){ cout << 1 << endl; }
		else if (sum != 0){

			while (sum > 9){

				sum /= 10;
				count++;

			}
			//?????°???count?????°
			cout << count + 1 << endl;
		}
	}


	return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int x,y;
    for(;;){
        cin >> x >> y;
        if(cin.eof())   break;
        cout << to_string(x+y).length() << "\n";
    }
}

C++: #include <iostream>
#include <functional>
#include <vector>
#include <algorithm>
#include <cmath>

int main(){
	int i;
	int j;
	while (std::cin >> i >> j){
		int t = i+j;
		int y;
		for ( y = 1; t / static_cast<int>(pow(10, y)) > 0; ++y){}
		std::cout << y << std::endl;
	}

	return 0;
}

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

int main() {
  long long int a, b;
  cin >> a >> b;
  long long int sum = a+b;
  cout << sum << endl;
  

  int cnt = 1;
  while(sum /= 10) cnt++;

  cout << cnt << endl;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
  int a,b;
  int k=0;
  int s=0;
  int i;
  int ke[999]={0};
  while(cin>>a>>b){
  s=a+b;
  while(s>=10){
    s=s/10;
    ke[k]++;
  }
  k++;
}
  for(i=0;i<k;i++){
  cout<<ke[i]+1<<endl;
}
  return 0;
}

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

C++: #include "bits/stdc++.h"
using namespace std;
int main(){
    int a, b;
    while(cin >> a >> b){
        string sum = to_string(a + b);
        cout << sum.size() << endl;
    }     
    return 0;
}

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

#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}
#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}
#define Cout(x) cout<<(x)<<endl
#define POSSIBLE(condition) if(condition){cout << "POSSIBLE" << endl;}else{cout << "IMPOSSIBLE" << endl;}
#define Possible(condition) if(condition){cout << "Possible" << endl;}else{cout << "Impossible" << endl;}
#define possible(condition) if(condition){cout << "possible" << endl;}else{cout << "impossible" << endl;}
#define Size(n) (n).size()

typedef long long ll;


using namespace std;

const int INF = 1e9,MOD = 1e9 + 7,ohara=1e6;
const ll LINF = 1e18;

/*---------------------------------------------------------------
long long int kaizyo(long long int hh){
    cmp=1;
    while(hh>1){
        cmp=(cmp*hh)%MOD;
        hh--;
    }
    return cmp;
}
long long int ruizyo(long long int aa, long long int bb){
    if(aa==0){
        return 1;
    }
    else if(aa%2==0){
        long long int tt=ruizyo(aa/2,bb);
        return (tt*tt)%MOD;
    }
    else{
        return (ruizyo(aa-1,bb)*bb)%MOD;
    }
}フェルマ－のア
---------------------------------------------------------------

while(x!=0){
            sum+=x%10;
          / x/=10;
        }
        各桁の和
---------------------------------------------------------------

pair<int,int> p[100000];
cin >> tmp;
p[i]=make_pair(tmp,i);
cout << p[i].second+1 << endl;//ペアの右側つまりiを出力

---------------------------------------------------------------

bool f[100001];//1000000以下の素数を調べよう！
rrep(i,2,100001){
       f[i]=false;
    }
rrep(i,2,100001){
        if(!f[i]){
            for(int j=i+i;j<=100000;j+=i){
                f[j]=true;
            }
        }
    }
    for(int i=3;i<=100000;i+=2){
        if(!f[i]){
            c[i]++;
        }
    }

---------------------------------------------------------------

long long gcd(long long aaa,long long bbb){
    if(bbb==0){
        return aaa;
    }
    return gcd(bbb,aaa%bbb);
}
 
long long lcm(long long aaa,long long bbb){
    long long g = gcd(aaa,bbb);
    return aaa/g * bbb;
}左から最大公約数と最小公倍数


---------------------------------------------------------------

long long int prime_cnt[10000];
       for(int i=2;i*i<=n;i++){
           while(n%i==0){
               n/=i;
               prime_cnt[i]+=1;
           }
           if(n>1){
               prime_cnt[n]+=1;
               break;
           }
      }ある数nを素因数分解しましょう

---------------------------------------------------------------
debug:
cout<<"i: "<<i<<" j: "<<j<<" cnt: "<<cnt<<"\n";

---------------------------------------------------------------*/

long long int n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("abcdefghijklmnopqrstuvwxyz"),s,co;
bool fl=true;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);

      
       while(1){
           a=-1;b=-1;
           cin>>a>>b;
           pos=a+b;
           if(a==-1&&b==-1)break;
           s=to_string(pos);
          // co=to_string(b);
           Cout(Size(s));
       }
       
return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main(void){
	int n , i , j , k ;
	for( i=1 ; i<=3 ; i++ ){
		cin >> j >> k ;
		int x = j+k;
		stringstream str;
		str << x ;
		string st = str.str();
		cout << st.size() << endl;
	}	
}

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

C++: #include<iostream>
using namespace std;
int main(){
int a,b,i,c=0;
while(1){
cin>>a>>b;
a=a+b;
for(i=1;i<10000000000;i*=10){
	if(a/i==0)break;
	c++;
}

cout<<c<<endl;
}
return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int a,b;
  cin>>a>>b;
  a+=b;
  int t=0;
  while(a>0){
    a/=10;
    t++;
  }
  cout<<t<<endl;
}

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

using namespace std;

int main(){
	int a,b;

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

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 i, a, b;
    int j[200];
    for(i=0; i<3; i++){
        cin>>a>>b;
        j[i]=a+b;
    }
    for(i=0; i<3; i++){
        if(a>=0 and b<= 1000000){
            cout<<j[i]<<endl;
        }
    }
    return 0;
}