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>

using namespace std;

int getDigitNumber(int n){
  return n > 0 ? 1 + getDigitNumber(n / 10) : 0;
}

int main(int argc, char const *argv[]) {
  while(true){
    int a,b;
    cin >> a >> b;
    cout << getDigitNumber(a+b) << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <math.h>
using namespace std;
int main(){
	int a,b;
	int sum=0;
	int count=0;
	vector<int> digits;
	for(int i=0;i<200;i++){
	 cin >> a >> b;
	 sum = a + b;
	 digits.push_back(log10(sum)+1);
	}
	for(int i=0; i<digits.size();++i){
		cout << digits[i] << endl;
	}
	vector<int>().swap(digits);
	return 0;

}

C++: #include <iostream>
int main(void)
{
    int array[2];
    while(std::cin >> array[0] >> array[1]){
        array[0] += array[1];
        array[1] = 0;
        do{
            array[0] /= 10;
            ++array[1];
        }while(array[0]);
        std::cout << array[1] << std::endl;
    }
    return 0;
}

C++: //
// Created by tac on 2016/10/27.
//

#include <cstdlib>
#include <iostream>
#include <cmath>

namespace {
int digit(long n) {
    return static_cast<int>(std::floor(std::log10(n)) + 1);
}
}

int main() {
    long a, b;
    while (true) {
        if (std::cin.eof()) {
            break;
        }
        std::cin >> a >> b;
        std::cout << digit(a + b) << std::endl;
    }
    return EXIT_SUCCESS;
}

C++: #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>

#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
#define bl bool
#define nn printf("\n");
#define mod 1000000007

using namespace std;

string Num2Str(int num)
{
	stringstream ss;
	ss << num;
	return ss.str();
}
int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int a = 0, b = 0;
	while (cin >> a >> b)
	{
		int sum = a + b;
		string str;
		str = Num2Str(sum);
		printf("%d\n", str.size());
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
	for (int a, b; cin >> a >> b && a && b;) {
		a += b;
		int count = 0;
		for (; a; a /= 10) {
			count++;
		}
		cout << count << endl;
	}
	return 0;
}

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

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

C++: #include <iostream>
#include <cmath>
using namespace std;
 
int main()
{
    int a,b;
    while(cin >> a >> b)
        cout << log10(a+b) + 1 << '\n';
 
    return 0;
}

C++: #include <iostream>

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

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>


int main()
{
    int a,b;
    char str[32], *p;
    while(1){
        gets(str);
        if(strlen(str) == 0)return 0;
        a = atoi(strtok(str, " "));
        b = atoi(strtok(NULL, " "));
        sprintf(str,"%d",a+b);
        printf("%d\n",strlen(str));
    }
}

C++: #include <iostream>
using namespace std;
int main(){

	long a,b;
	
	while(cin>>a>>b){
		long c = a+b;
		long d = 1;
		long e = 10;
		for(int j=0;j<10;j++){
			if(c == 0){
				cout<<1<<endl;
			}else if(c >= d && c < e){
				cout<<j+1<<endl;
			}
			d = d * 10;
			e = e * 10;
		}
		
	}	
	return 0;
}

C++: #include <iostream>

int main(void){
while (!std::cin.eof()){
int a,b,c,i=0;
std::cin >> a >> b;
if(std::cin.eof())
break;
c=a+b;

while(c/=10)
i++;

std::cout << i+1 << std::endl;
}
return 0;
}

C++: #include <iostream>
#include <algorithm>
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 < (10 ^ k)){
            k++;
        }
        keta[now] = k;
    }
    
    int n = 0;
    while(keta[n]){
        cout << keta[n] << endl;
        n++;
    }
    
    
    return 0;
}

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

int number_of_digits(int n) {
	int result = 0;
	while (n != 0) {
		result++;
		n /= 10;
	}
	return result;
}

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

C++: #include <iostream>
using namespace std;
int main() {
	int A, B, C, i = 10, test = 1;
	while (cin >> A >> B) {
		C = A + B;
		if (C < 10) {
			cout << 1 << endl;
		}
		else {
			while (test != 0) {
				i = i * 10;
				test++;
				if (C < i) {
					cout << test << endl;
					test = 0;
				}
			}
		}
	}
}

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

int main(){
	int a,b,c;
	int ans;
	
	for(inti=0;i<103;i++){
		cin>>a>>b;c=a+b;
		//-----test-----
		i
		//--------------
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include <iostream>

using namespace std;

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

int main()
{
	solve();
	return(0);
}

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

int main() {
  int x, y;
  while(true) {
    cin >> x >> y;
    if(x == -1) {
      break;
    }
    cout << x + y << endl;
  }
}

C++: #include <iostream>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <cmath>
using namespace std;
const int M = 100000;
const double pi = 3.141592653589;

int main()
{
	int a, b;
	while (cin>>a>>b) {
		cin >> a >> b;
		a = a + b;
		int count = 0;
		while (a > 0) {
			a /= 10;
			count++;
		}
		printf("%d\n", count);
	}
}

C++: #include <stdio.h>
#include <string.h>
#include <stdlib.h>

int main()
{
    int IsB = 0,i = 0;
    char a[100],b[100],*digits;
    while(1){
        char str = '\0';
        scanf("%c",&str);
        if(str == '\0')return 0;
        if(str == ' '){
            i = 0;
            IsB = 1;
        }else if(str == '\n'){
            sprintf(digits,"%d",atoi(a) + atoi(b));
            printf("%d\n",strlen(digits));
            i = 0;
            IsB = 0;
        }else if(IsB == 0){
            a[i++] = str;
        }else{
            b[i++] = str;
        }
    }
}

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

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

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

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,ll> P;
typedef pair<ll,P> PP;

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

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

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

	return 0;
}