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 <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i,N) for(int i = 0; i < (int)N; i++)

int main(){
	int hako[200][2];
	int i=0;
	int b;
	while(cin >> b){
		hako[i][0] = b;
		cin >> hako[i][1];
		i++;
	}
	REP(j,i){
		int a=0;
		int sum = hako[j][0] + hako[j][1];
		while(sum > 0) sum/10,a++;
		cout << a <<endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
  int a,b;
  while(1){
    float c;
    cin >> a >> b;
    a+=b;
    if(cin.eof())break;
    for(;a/10.0>0.0;c++){
      a%=10;
    }
    cout << c << endl;
  }

  return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int n, m, dig;
    while(cin >> n >> m){
        dig = 0;
        n += m;
        while(n){
            n /= 10;
            dig++;
        }
        cout << dig << endl;
    }
}

C++: #include<iostream>
#include<cmath>
using namespace std;
 
int main()
{
    int num1, num2,sum;
    int n = 1;
    cin >> num1 >> num2;
 
    sum = num1 + num2;
 
    while (true)
    {
        int po = pow(10, n);
        if (!((sum % po) == sum))
            n++;
        else
            break;
    }
 
    cout << n << endl;
 
    cin >> n;
    return 0;
}

C++: #include<iostream>

int main() {
	int a, b,total,truss;
	while (std::cin >> a >> b) {
		total = a + b;
		for (truss = 0; total != 0; truss += 1) {
			total = int(total / 10);
		}
		std::cout << truss << std::endl;



	}
	return 0;
}

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

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

using namespace std;
int main()
{
    long long a,b,sum,fun,cnt;
    while(cin>>a>>b)
    {
        cnt=0;
        sum=a+b;
        for(;;)
        {
            fun=sum;
            sum=fun/10;
            cnt++;
            if(sum<=0) break;
        }
        cout<<cnt<<endl;
    }
    return 0;
}

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

C++: #include <iostream>
using namespace std;
int solve(int a,int b){
    int sum=a+b,ans=0;
    while(sum>0){
        ans++;
        sum/=10;
    }
    return ans;
}
int main(void){
    int a[300]={},b[300]={},i=0;
    cin>>a[0]>>b[0];
    cin>>a[1]>>b[1];
    while(a[i]!=a[i+1]&&b[i]!=b[i+1]){
        cin>>a[i+2]>>b[i+2];
        i++;
    }
    for(int j=0;j<i;j++){
        cout<<solve(a[j],b[j])<<endl;
    }
    return 0;
}

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

C++: #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<numeric>
#include<vector>
#include<iostream>
#include<map>

using namespace::std;

int main(void)
{

  int a,b;

  while(cin >> a >> b)
    {
      int ab = a + b;

      char c_num[64];

      sprintf(c_num , "%d" , ab);
      string s_num = (string)c_num;
      cout << s_num.size() << endl;
    }

  return 0;
}

C++: #include <iostream>

using namespace std;

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

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

using namespace std;
int main(){
	int a,b;
	while(!cin.eof()){
		cin >> a >> b;
		cout << int(log10(a))+int(log10(b))+2 << endl;
	}
	return 0;
}

C++: #include<iostream>                                                                 
                                                                                   
int main(void){                                                                    
  int a,b,c,i=0;                                                                   
  std::cin >> a >> b;                                                              
  c =a+b;                                                                          
 FLAG:                                                                             
    c =c/10;                                                                       
    i++;                                                                           
    if(0<c){                                                                       
      goto FLAG;                                                                   
    }                                                                              
  std::cout << i << std::endl;                                                     
  return 0;                                                                        
}

C++: #include <stdio.h>

int main(void)
{
	int a,b;
	char num[1000];
	int i=0;
	int count=0;
	
	scanf("%d %d",&a,&b);
	
	snprintf(num,1000, "%d", a+b);
	
	for(i=0;i<1000;i++)
	{
		if(num[i] == 0)
		{
			goto result;
		}
	}
	
	result:
	
	printf("%d\n",i);
	
	return 0;
	
}

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

C++: #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename Q_temp>
using smaller_queue = priority_queue <Q_temp, vector<Q_temp>, greater<Q_temp> >;

const int INF = (int) 1e9;
const ll LINF = (ll) 4e18;
const ll MOD = (ll) (1e9 + 7);
const double PI = acos(-1.0);
const int limit = 100010;

#define REP(i,m,n) for(ll i = m; i < (ll)(n); ++i)
#define rep(i,n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbg2(x_) for(auto a_ : x_) cerr << a_ << " "; cerr << endl;
#define dbg3(x_ , sx_) rep(i, sx_) cerr << x_[i] << " "; cerr << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

inline ll CEIL(ll a, ll b) {
    return (a + b - 1) / b;
}

//------------------------------------------------------

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int a, b;
    while (cin >> a >> b) {
        string s = to_string(a + b);
        cout << s.length() << endl;
    }
    return 0;
}

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

using namespace std;

int main(){
        double a, b;
        int i, c;
        scanf("%lf%lf", &a, &b);
        c = 1;
        for(i = 0; c >= 0; i++){
                c = (a + b) - pow(10, i);
        }
        printf("%d\n", i - 1);
        return 0;
}