Go: package main

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

func sliceAtoi(sa []string) ([]int, error) {
	si := make([]int, 0, len(sa))
	for _, a := range sa {
		i, err := strconv.Atoi(a)
		if err != nil {
			return si, err
		}
		si = append(si, i)
	}
	return si, nil
}

func getDigits(ary []int) (digits int) {
	sum := 0
	for _, v := range ary {
		sum += v
	}

	for sum != 0 {
		sum /= 10
		digits++
	}
	return
}

func getsTwoNumAsArray() (nums [][]int) {
	scanner := bufio.NewScanner(os.Stdin)

	for scanner.Scan() {
		str := scanner.Text()
		if str == "" {
			break
		}

		ary, _ := sliceAtoi(strings.Split(str, " "))
		nums = append(nums, ary)
	}

	return
}

func main() {
	ary := getsTwoNumAsArray()

	for _, v := range ary {
		fmt.Println(getDigits(v))
	}
}

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

int main(){
	int a,b,c;
	int ans;
	bool flg;
	int cnt=-1;
	
	while(cin>>a>>b){
		cnt++;flg=false;
		//-----test-----
		switch(cnt){
		case 0:
			if(!(900000<a)) flg=true; 
			break;
		}
		
		if(flg) break;
		
		//--------------
		c=a+b;
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<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 <iostream>
using namespace std;

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

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

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

C++: #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll a,b,sum,z;
    while(cin>>a>>b)
    {
        sum=a+b;
        z=floor(log10(sum))+1;
        cout<<(ll)z<<endl;
    }
    return 0;
}

C++: #include<cstdio>
int main(){for(int a,b;~scanf("%d%d",&a,&b);printf("%d\n",sprintf((char*)&a,"%d",a+b)));}

C++: #include <iostream>
using namespace std;
int digit(int num){
	int cnt=0;
	while(num>0){
		num/=10;
		cnt++;
	}
	return cnt;
}

int main(){
	int A[210],B[210];
	int N;
	for(int i=1;i<=200;i++){
		cin>>A[i]>>B[i];
		if(cin.eof()){
			N=i-1;
			break;
		}
	}
	for(int i=1;i<=N;i++){
		cout<<digit(A[i]+B[i])<<endl;
	}
	return 0;
}

C++: 
#include "cstdio"


int main()
{
	int a,b,i=0;
	scanf("%d%d\n",&a,&b);

	a += b;
	while(a/10 == 0){
		a/=10;
		i++;
	}
	printf("%d",i);

	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
using namespace std;
typedef  long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)

string bigsum(string A, string B) {
	//A+Bを返す
	vector<char>num(10);
	num = { '0','1','2','3','4','5','6','7','8','9' };
	if (A.size() > B.size()) {
		swap(A, B);
	}
	int a = A.size();
	int b = B.size();
	int size = b + 1;
	reverse(A);
	reverse(B);
	vector<int>V(size, 0);
	rep(i, a) {
		V[i] = (A[i] - '0') + (B[i] - '0');
	}
	for (int i = a; i < b; i++) {
		V[i] = (B[i] - '0');
	}
	rep(i, size - 1) {
		V[i + 1] += (V[i] / 10);
		V[i] %= 10;
	}
	reverse(V);
	int flag = false;
	string ret;
	rep(i, size) {
		if (V[i] == 0 && flag == false)continue;
		else {
			ret.push_back(num[V[i]]);
			flag = true;
		}
	}
	return ret;
}

int main() {
	string A, B;
	while (cin >> A >> B) {
		cout << bigsum(A, B).size() << endl;
	}
}

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

int main()
{
        int a, b, i;
        int sum;        

        while(scanf("%d %d", &a, &b) != EOF){
                sum = a + b;
                for(i=0; sum>0; i++){
                        sum /= 10;
                }

                cout << i << endl;
        }

        return 0;
}

C++: import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        while(true) {
            try{
            String[] line = br.readLine().split(" ");
            int length = String.valueOf(Integer.parseInt(line[0]) + Integer.parseInt(line[1])).length(); 
            System.out.println(length);
            }catch(NullPointerException e) {
                break;
            }
        }
    }
}

C++: #include<stdio.h>
int main (void){
	int x1,x2,s=1,gou;
	scanf("%d %d",&x1,&x2);
	gou = x1 + x2;
	if(gou < 10){
	}
	while(gou >= 10){
		gou = gou / 10;
		s = s+1;
	}
	printf("%d",s);	
	return(0);
}

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

using namespace std;

int main() {

	int a, b, c, count = 0;
		while (cin >> a >> b) {
			c = a + b;
			while (c) {
				c = c / 10;
				count++;
			}
			cout << count << endl;
		}

	return 0;

}

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

using namespace std;

int calc_digit(int x)
{
	 int i;
	 for(i = 1;;i++){
		 if(int(x / pow(10,i)) == 0)
			 return i;
	 }
}

int main(){
	int a[200],b[200];
	int i,j;
	i = 0;
	while(cin >> a[i] >> b[i]){
	    if(a[i] < 0 || 1000000 < a[i])
			break;
		if(b[i] < 0 || 1000000 < b[i])
			break;
		if(i >= 200)
			break;
		i++;
	}
	for(j = 0; j < i;j++)
		cout << calc_digit(a[j] + b[j]) << endl;
}

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

using namespace std;

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

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



int main() {
	int a, b, c,count=0;
	while (cin >> a && cin >> b) {
		c = a + b;

		while (c > 0) {
			c /= 10;
			count++;
		}

		cout << count << endl;
		count = 0;
	    
	}
	return 0;
}

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

int log(int a, int X){
	int n = 0;
	
	while(X > 0){
		X /= a;
		n++;
	}
	
	return n;
}

int main(){
	int a, b, sum;
	
	while(scanf("%d%d", &a, &b) != EOF){
		
		sum = a + b;
		
		printf("%d\n", log(10, sum));
	}
	
	return 0;
}

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

int main(void){
	int a,b,T,c,d,e,f,g,h,i,A=0;
	while(cin>>a>>b){
		T=a+b;
		
		c=T/1000000;
		if(c>=1) A=A+1;
		
		d=T/100000;
		if(d>=1)A=A+1;
		
		e=T/10000;
		if(e>=1)A=A+1;
		
		f=T/1000;
		if(f>=1)A=A+1;
		
		g=T/100;
		if(f>=1)A=A+1;
		
		h=T/10;
		if(h>=1)A=A+1;
		
		i=T/1;
		if(i>=1)A=A+1;
		
		cout<<A<<endl;
	}
	return 0;
}