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<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = {-2};

void input() {
	int i = 0;

	while (CI data_[i][0] >> data_[i][1]) {
		i++;
	}

	return;
}


int main(void) {
	input();
	int i = 0;
	int sum = 0;
	int numb = 0;

	while (data_[i][0] != EOF) {
		sum = data_[i][0] + data_[i][1];
		while (sum != 0) {
			numb++;
			sum /= 10;
		}
	}

	CO numb E

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<numeric>
#include<vector>
#include<iostream>
#include<map>

using namespace::std;

int main(void)
{

  int a,b;

  cin >> a >> b;

  int ab = a + b;

  char c_num[64];

  sprintf(c_num , "%d" , ab);
  string s_num = (string)c_num;
  cout << s_num.size() << endl;

  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)!=EOF){
		a+=b;
		n=log((double)a)/log(10.0);
		printf("%d\n",(int)(n+1.0));
	}
	return 0;
}

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;
        now++;
        if( !cin.peek() ){
            break;
        }
    }
    
    
    //printf("finished");
    
    for (int i = 0; i < now; i++) {
        cout << keta[i] << endl;
    }
    
    
    return 0;
}

C++: import java.util.*;

class Main{
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			int n= sc.nextInt();
			int o= sc.nextInt();
			int wa = n+o;
			System.out.println(sum(wa));
			}
		sc.close();



	}
	static int sum(int n){
		int i=1;
		int t=10;
		while(n>=t){
			t=t*10;
			i++;
			}
		return i;
	}
}

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

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

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

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

C++: #include<iostream>
using namespace std;
int main(){
    int a[1000000],b[1000000],i,j,n;
    cin>>n;
    for(i=0;i<n;i++){
        cin>>a[i]>>b[i];
    }
    for(j=0;j<n;j++){
        if(a[j]+b[j]<10){
            cout<<"1"<<endl;
        }
        else if(a[j]+b[j]<100){
            cout<<"2"<<endl;
        }
        else if(a[j]+b[j]<1000){
            cout<<"3"<<endl;
        }
        else if(a[j]+b[j]<10000){
            cout<<"4"<<endl;
        }
        else if(a[j]+b[j]<100000){
            cout<<"5"<<endl;
        }
        else if(a[j]+b[j]<1000000){
            cout<<"6"<<endl;
        }
        else if(a[j]+b[j]<=1999999){
            cout<<"7"<<endl;
        }
    }
    return 0;
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = {-2};

void input() {
	int i = 0;

	while (scanf_s("%d%d",&data_[i][0],&data_[i][1]) != EOF) {
		i++;
	}

	return;
}


int main(void) {
	input();
	int i = 0;
	int sum = 0;
	int numb = 0;

	while (true) {
		sum = data_[i][0] + data_[i][1];
		while (sum != 0) {
			numb++;
			sum /= 10;
		}
		if (data_[i + 1][0] == -2) {
			break;
		}
	}

	CO numb E

	return 0;
}

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

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

C++: #include <iostream>

using namespace std;

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

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

using namespace std;

int main() {
    int tmpa, tmpb;
    vector<int> a;
    vector<int> b;
    
    while (cin >> tmpa >> tmpb) {
        a.push_back(tmpa);
        b.push_back(tmpb);
    }
    
    for (int i = 0; i < a.size(); i++) {
        int sum = a[i] + b[i];
        int keta = 0;
        while (sum > 0) {
            sum /= 10;
            keta++;
        }
        cout << keta << endl;
    }

    return 0;
}

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

int main(){
	int a,b;
	while(scanf_s("%d %d",&a,&b) != EOF)
		printf_s("%d\n",(int)log10((double)a+b)+1);
}

C++: #include <iostream>
  
u_int getDigit(u_int n){
    u_int digit = 0;
      
    while(n > 0){
        n /= 10;
        ++digit;
    }
      
    return digit;
}
    
int main(){
    u_int a, b;
      
    while(std::cin >> a >> b){
        std::cout << getDigit(a + b) << std::endl;
    }
      
    return 0;
}