Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
	"unicode/utf8"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	var strs []string
	var a, b, sum int64
	var digits int
	for scanner.Scan() {
		strs = strings.Split(scanner.Text(), " ")
		a, _ = strconv.ParseInt(strs[0], 10, 64)
		b, _ = strconv.ParseInt(strs[1], 10, 64)

		sum = a + b
		// goでlen(string)はbyte数が返る
		digits = utf8.RuneCountInString(strconv.FormatInt(sum, 10))

		fmt.Printf("%d\n", digits)
	}
}

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

int main(){
    int a,b;
    while((cin >> a >> b),(a|b)!=EOF){
        int cnt = 0;
        int n = a+b;
        if(n!=0)for(cnt=0;n>0;cnt++)n/=10;
        else cnt = 1;
        cout<<cnt<<endl;
    }
    return 0;
}

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

// Digit Number(0002)
int main()
{
	int a, b;
	cin >> a >> b;
	
	stringstream ss;
	ss << a + b;

	cout << ss.str().length() << endl;

	return 0;
}

C++: //-------------
//include
//-------------
#include <map>
#include <list>
#include <cmath>
#include <vector>
#include <string>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
//-------------
//typedef
//-------------
typedef long long LL;
typedef  vector<int> VI;
typedef  string STR;
typedef  pair<int, int> PII;
typedef  vector<int, int> VII;
typedef  map<string, int> MSI;
//-------------
//utillty
//-------------
#define ALL(a)  (a).begin(),(a).end()
#define MK make_pair
#define PB push_back
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define COUT(a) cout<<a<<endl
//-------------
//repetition
//-------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
//-------------
//debug
//-------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define dumpl(c) REP(i,SZ(c))cerr<<#c<<i<<"="<<(c[i])<<endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const int MOD = 1000000007;
int main()
{
	int a, b;
	while (cin >> a>> b)
	{
		int x = a + b;
		int count = 0;
		while (x >= 10)
		{
			x /= 10;
			count++;
		}
		COUT(count);
	}
#ifdef _DEBUG
	while(1);
#endif // _DEBUG

	return 0;
}

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

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="77675555555555555555555555555555555555555455555555555555555555555";
	
	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<stdio.h>
int main(void)
{
	int a[100], b[100], c, i;
	for(i=0;(a[i]!='\n')||(b[i]!='\n');i++)
	{
		scanf("%d %d", &a[i], &b[i]);
		c = a[i]+b[i];
		printf("%d\n", log(c));
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int a,b,c,d=1000000,e=7;
	for(int i=1;i<=200;i++){
		cin>>a>>b;
		c=a+b;
		while(1){
			if(c==0){
				cout<<"1"<<endl;
				break;
			}
			if(1<=c/d){
				cout<<e<<endl;
				break;
			}
			else if(1>c/d){
				e--;
				d=d/10;
			}
		}
		d=1000000,e=7;
	}	
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007

#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define MOD(x) (x%(mod))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;

bool debug=false;
/*---------------------------------------------------*/

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

C++: #include <bits/stdc++.h>
using namespace std;

int a;
int b;

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

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 > MAX)) {
   continue;
  }
  
  sets[cnt] = a + b;
  ++cnt;
 }

 for(i = 0;i <= cnt;++i) {
  for(j = MAX;j >= MIN;) {
   if((sets[i] / j) != 0) {
    ++buf;
    sets[i] -= (sets[i] / j) * j;
   }
  }
  
  buf = 0;
 }

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

 return 0;
}

C++: //
//  main.cpp
//  sanpie
//
//  Created by h3037178 on 2017/07/28.
//  Copyright ?? 2017??´ ?????£?????????. All rights reserved.
//

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    int i,o;
    for(int p=0;p<200;p++){
    cin>>i>>o;
    if(i+o<10){
        cout<<"1"<<endl;
    }else if(i+o<100){
        cout<<"2"<<endl;
    }else if(i+o<1000){
        cout<<"3"<<endl;
    }else if(i+o<10000){
        cout<<"4"<<endl;
    }else if(i+o<100000){
        cout<<"5"<<endl;
    }else if(i+o<1000000){
        cout<<"6"<<endl;
    }else{
        cout<<"7"<<endl;
    }
    }
}

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

int a,b,c,hasil;

int main()
{
	while(true)
	{
		scanf("%d %d",&a,&b);
		if (a=='\0')
		{
			break;
		}
		hasil=1;
		c=a+b;
		while(c>=10)
		{
			c=c/10;
			hasil++;
		}
		printf("%d\n",hasil);
	}
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int count(int x)
{
	int counter = 0, t;
	for (long temp = x; temp != 0;)
	{
		t = temp % 10;
		temp = temp / 10;
		if (t != 0)
			counter++;
	}
	return counter;
}
int main()
{
	long a, b;
	for (;;)
	{
		if (scanf("%ld%ld", &a, &b) == EOF)
			break;
		cout << count(a) + count(b) << endl;
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

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

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

int main(){
    int a,b;
    
    while(cin >> a >> b){
        int cnt=1;
        int c=10;
        for(int i=0;i<8;i++){
            //cout << c << ' ' << cnt << endl;
            if((a+b)-c<0)break;
            //cout << a << ' ' << b << '=' << a+b << endl;
            cnt++;
            c*=10;
        }
        cout << cnt << endl;
    }
    
    
    return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
  int cnt = 0,
      x, y;
  while(cin >> x >> y){
    if(cin.eof())
      break;
    if(x < 0 || y > 1000000 || cnt > 200)
      break;
    cnt = to_string(x+y).length();
    cout << cnt << endl;
  }
}

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

}
return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int num[2];
	int numLength = sizeof(num) / sizeof(num[0]);
	int n = 1;
	int sum = 0;
	
	int h;
	for(h = 0; h < numLength; h++)
	{
		cin >> num[h];
		sum += num[h];
	}
	
	while(sum/10 != 0){
		n++;
		sum = sum / 10;
	}
	
	cout << n << endl;
	
	return(0);
}