Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func Sliceconvtoi() []int {
	strs := strings.Split(sc.Text(), " ")

	var ints []int
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		ints = append(ints, x)
	}

	return ints
}

func main() {
	for sc.Scan() {
		i := Sliceconvtoi()
		fmt.Println(int(math.Log10(float64(i[0]+i[1]))) + 1)
	}

}

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

int main(void) {
	int a=0,b=0,n=1;
	while (scanf("%d %d",&a,&b) != EOF)
	{
		while ((a+b)>=pow(10,n))
		{
			n++;
		}
		cout << n << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()

int main() {
    int i, j;
    while(cin >> i) {
        cin >> j;
        cout << i + j << endl;
    }
    return 0;
}

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

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

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

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

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

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

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

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

C++: #include <stdio.h>

int main(){

	int a=0,b=0,x=0;

	while (scanf("%d%d", &a, &b)!=EOF){
		
		if (a + b < 1000000){
			x=6;
		}else if(a + b < 100000){
			x=5;
		}else if (a + b < 10000){
			x=4;
		}else if (a + b < 1000){
			x=3;
		}else if (a + b < 100){
			x=2; 
		}else if (a + b < 10){
			x = 1;
		}printf("%d", x); x++;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
	
	int i;

	int a,b,sum,figure;

	cin >> a >> b;

	sum = a + b;

	
	figure = 1;
	while(sum/10!=0){
		sum = sum/10;
		figure++;
	}
	cout << figure << "\n";
	
	return 0;
}

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

using namespace std;

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

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

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

C++: #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;
const int INF = 0x7fffffff;

int gcd(int x,int y){
  int mi,ma;
  ma = max(x,y);
  mi = min(x,y);
  if(ma % mi == 0){
    return mi;
  }
  else{
    return gcd(mi,ma % mi);
  }
}

int main(){
  long ii,jj,kk;

  int a,b,d;
  char c[1000];
  while(cin >> a >> b){
    //cout << a + b;
    sprintf(c,"%d",a+b);
    cout << strlen(c) << endl;
  }
  
  return 0;
}

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(scanf("%d %d",&a,&b)!=EOF){
  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++: #define scanf_s scanf
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAX 201
int main(void)
{
	int a, b, i, sum, cou = 0;
	int ans[MAX] = { 0 };
	while (scanf_s("%d %d", &a, &b) != EOF) {
		sum = a + b;
		++ans[cou];
		if (sum != 0){
			while (1) {
				if (sum <= 1) break;
				sum /= 10;
				++ans[cou];
			}
		}
		++cou;
	}
	for (i = 0; i < cou; ++i) {
		if (i != 0) printf("\n");
		printf("%d", ans[i]);
	}
}

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

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

int calcdigit(int c){
	int res=1;
	bool flg=true;
	while(flg){
		if(c/10==0){
			break;
		}
		++res;
		c=c/10;
	}
	return res;

}
int main() {
    clock_t cTimeStart, cTimeEnd;
    cTimeStart = clock();           // 現在時刻
    int a,b;
   	while(1){
   		cin>>a>>b;
	    cout<<calcdigit(a+b)<<endl;
   		if(cin.eof()){break;}
   	}


    cTimeEnd = clock();           // 現在時刻
//    cout<< "処理時間:" <<(cTimeEnd - cTimeStart)/1000 << "[ms]" << endl;

	return 0;
}

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

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

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

C++: while line = gets do
    p ->(l){(l[0]+l[1]).to_s.size}.call line.split(' ').map(&:to_i)
end

C++: #include <cstdio>

#define MAX 1000000
#define MIN 0
#define SIZE 200

int main() {
 int i,j;
 int a,b;
 int cnt = 0;
 int buf = 0;
 int sets[SIZE];

 while(scanf("%d %d",&a,&b) != EOF) {
  if((a < MIN) || (b < MIN) || (a > MAX) || (b > MAX)) {
   continue;
  }
 
  sets[cnt] = a + b;
  ++cnt;
 }

 for(i = 0;i <= cnt;++i) {
  while(j > MIN) {
   buf += ((sets[i] / j) * j);
   j /= 10;
  }
  
  sets[i] = buf;
  buf = 0;
 }

 for(i = 0;i <= cnt;++i) {
  printf("%d\n",sets[i]);
 }

 return 0;
}

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

int main()
{
	ifstream fin(argc[1]);
	int a,b;
	int wa;
	while( !fin.eof() ) {
		int count = 0;
		fin >> a >> b;
		wa = a + b;
		while(0){
			if(wa / 10 == 0){
				cout << count << endl;
				break;
			}
			wa/=10;
			count++;
		}
	}
	return 0;
}

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

int main(void){
	double n;
	int a,b;
	while(scanf("%d %d",&a,&b)!=-1){
		a+=b;
		if(a!=0) n=log((double)a)/log(10.0);
		else n=0;
		printf("%d\n",(int)(n+1.0));
	}
	return 0;
}

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

int calc_sum_bit(int sum)
{
	int res = 0;
	if (sum == 0) return 1;
	while (sum != 0)
	{
		++res;
		sum/= 10;
	}
	return res;
}

int main()
{
	int a, b;

	while(cin >> a >> b)
	{
		int sum = a + b;
		cout << calc_sum_bit(sum) << endl;
	}

	return 0;
}

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

int main(){
	int a,b,keta[300] = {0},kcor = 0;
	while(cin >> a){
		cin >> b;
		if(a+b == 0){
			keta[kcor] = 1;
		}
		else{
			keta[kcor] = log10(double(a+b))+1;
		}
		kcor++;
	}
	for(int i = 0;i < kcor;i++){
		cout << keta[i] << endl;
	}
	return 0;
}