Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	return strconv.Atoi(nextString())

}

func main() {
	scanner.Split(bufio.ScanWords)

	for {
		a, err := nextInt()
		if err != nil {
			break
		}
		b, _ := nextInt()

		s := a + b
		nDigits := int(math.Log10(float64(s))) + 1
		fmt.Println(nDigits)
	}
}

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

C++: #include <iostream>
  
using namespace std;  
  
// 入力  
int a, b;  
  
void solve()  
{  
    int res = 0;  
  
    a += b;  
  
    for (; a; a /= 10)  
        res++;  
  
    cout << res << endl;  
}  
  
int main()  
{  
    while (cin >> a >> b)  
        solve();  
  
    return 0;  
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="7767555555555555";
	
	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>
using namespace std;

int main(void){
  int a,b;
  cin>>a>>b;
  int c=a+b;
  int count=1;
  while(1){
    if(c/10<10)break;
    c=c/10;
}
  cout<<count<<endl;
  return 0;
}

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

int main()
{
 int a, b;

 while(cin >> a >> b){
  int mas = a + b;
  int n = 0
  while(mas /= 10 != 0) n++
  cout << n+1 << '\n';
 }

 return 0;
}

C++: #include<iostream>

using namespace std;

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

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

C++: 
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
#include<stdio.h>
  
int main(){
  int i,j,count=0,sum;
int a[3],b[3];
  while(1){
if(scanf("%d %d",&a[i],&b[i]) == EOF){break;}
i++;
}
for(j = 0;j<i;j++){
sum = a[j]+b[j];
while(sum >0){
sum/=10;
count++;
}printf("%d\n",count);
count = 0;
}
}

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<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#define REP(i,n) for(long long int (i)=0;(i)<(n);i++)


using namespace std;


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

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

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

C++: #include<stdio.h>

int main(){

	int i,j;
	int data[6];

	for(i=0;i<6;i++){
		scanf("%d",&data[i]);
	}
	data[0]=data[0]+data[1];
	data[1]=data[2]+data[3];
	data[2]=data[4]+data[5];

	for(i=0;i<3;i++){
		for(j=0;j<10;j++){
			if(data[i]<10){
				data[i+3]=j;
			}else{
				data[i]=(int)data[i]/10;
			}
		}
		printf("%d",data[i+3]);
	}

	getchar();
    return 0;
???

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

int main(){
	int a,b;
	while(cin>>a>>b){
		int n=a+b;
		for(int i=0; i<9; i++){
			if(n==0){
				cout << i << endl;
				break;
			}
			n/=10;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#include<sstream>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define all(c) (c).begin(), (c).end()

using namespace std;
template<class T> inline void chmax(T& a, T b) { if(b > a) a = b; }
template<class T> inline void chmin(T& a, T b) { if(b < a) a = b; }

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

	return 0;
}

C++: #include <stdio.h>

int main(){

	int a=0,b=0,i;

	for (i = 0; i < 200;i++){
		scanf("%d%d", &a, &b);
		if (a + b < 10){
			printf("1\n");
		}else if(a + b < 100){
			printf("2\n");
		}else if (a + b < 1000){
			printf("3\n");
		}else if (a + b < 10000){
			printf("4\n");
		}else if (a + b < 100000){
			printf("5\n"); 
		}else{
			printf("6\n");
		}if (a + b == 0 );
	}
	return 0;
}

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

using namespace std;

int main() {

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

C++: //
//  main.cpp
//  CppTest
//
//  Created by Ryu on 2017/02/08.
//  Copyright ?? 2017??´ Ryu. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main(int argc, const char * argv[]) {
    // insert code here...
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    long a[200];
    long b[200];
    int keta[200];
    
    int now = 0;
    long p;
    while(cin >> a[now] >> b[now]){
        p = a[now] + b[now];
        int k = 0;
        while(p >= pow(10, k)){
            k++;
        }
        keta[now] = k;
        printf("%d", k);
        now++;
    }
    
    /*
    printf("finished");
    
    int n = 0;
    while(keta[n] == 0){
        printf("%d", keta[n]);
        n++;
    }
    */
    
    return 0;
}

C++: #include<complex>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<deque>
#include<queue>
#include<climits>
#include<list>
#include<stack>
#include<fstream>
#include<ctime>
#define all(n) n.begin(),n.end()
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define insert(a,b,c,d) PP(P(a,b),P(c,d))
#define F first
#define S second
#define pb push_back
#define INF (1<<27)
#define EPS 1e-10
#define equals(a,b) (fabs((a)-(b)) < EPS)

using namespace std;

typedef pair<int,int> P;
typedef pair<P,P> PP;
typedef unsigned long long ull;
typedef long long ll;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};


int main(){

  int a,b;
  while(cin >> a >> b){
    int c = a+b;
    stringstream ss;
    ss << c;
    string ret;
    ss >> ret;   
    cout << ret.size() << endl;
  }

  for(int j=0;j<=1000000;j++){
    string name = "out";
    stringstream ss;
    ss << j;
    string index;
    ss >> index;
    name += index+".txt";
    ofstream ofs(name.c_str());
      ofs << string(100000,'?') << endl;
    
  }

return 0;
}

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

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

int main(){
	unsigned int a[200] , b[200];
	int i , j , sum;
	for(i=0 ; i<200 ; i++){
		cin >> a[i] >> b[i];
	}
	for(i=0 ; i<200 ; i++){
		sum=a[i]+b[i];
		for(j=1000000 ; j>0 ; j/=10){
			if(sum/j!=0){
				cout << log10(j)+1 << endl;
				break;
			}	
		}
	}
}

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

int main(){
	int a, b, n, c;
	while( !cin.eof() )
	{
		cin >> a >> b;
		n = a + b;
		c = 1;
		while( (n = n / 10) != 0 )
			++c;

		cout << c << "\n";
	}
	
	return 0;
}