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>
int main(){
  int a,b,c;
  while(scanf("%d%d",&a,&b)!=EOF){
  	c = a + b;
  	if(c<10) printf("1");
  	else if(c<10^2) printf("2");
  	else if(c<10^3) printf("3");
  	else if(c<10^4) printf("4");
  	else if(c<10^5) printf("5");
  	else if(c<10^6) printf("6");
  	else if(c<10^7) printf("7");
  	else if(c<10^8) printf("8");
  	else if(c<10^9) printf("9");
  	else if(c<10^10) printf("10");
  	else if(c<10^11) printf("11");
  	else if(c<10^12) printf("12");
  	else if(c<10^13) printf("13");
  	else if(c<10^14) printf("14");
  	else printf("15");
  }
  return 0;
}

C++: #include <stdio.h>

int main(){

	int a=0,b=0;

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

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int keta(int n){
  static int cnt=0;
  if(n>0){
    cnt++;
    return keta(n/10);
  }else{
    return cnt;
  }
}
int main(){
  int a,b;
  int n;
  while(scanf("%d %d",&a,&b)!=EOF){
    a+=b;
    n=keta(a);
    cout<<n<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
using namespace std;
int main(){
	int n , i , j , k, x , y ;
	for( i=1 ; i<=200 ; i++ ){
		cin >> x >> y ;
		x = x+y;
		stringstream sr;
		sr << x ;
		string str = sr.str();
		cout << str.size() << endl;
	}
}

C++: #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <random>

using namespace std;

#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define REP(i,n) FOR(i,0,n)

int main()
{
  int a,b,cnt;
  while (scanf("%d %d", &a, &b)) {
    cnt = 0;
    a += b;
    while(a>0) {
      a/=10;
      ++cnt;
    }
    printf("%d\n", cnt);
  }
  return 0;
}

C++: #include <stdio.h>

int main(void)
{
	unsigned int a[2];
	int i;
	int b[2];
	int count;

	for(i = 0; i < 2; i++){
		scanf("%d", &a[i]);

		count = 0;
		do{
			count++;
		}while((a[i] = a[i]/10) > 0);

		b[i] = count;
	}

	printf("%d\n", b[0] + b[1]);
	
	return 0;
	
}

C++: //
//  main.cpp
//  Sample
//
//  Created by h3037183 on 2017/07/31.
//  Copyright ?? 2017??´ ?°????. All rights reserved.
//

#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
    int a,b,e=1;
    while(cin>>a>>b){
        if(a==0 && b==0)break;
        for(int z=10;z<1000000;z=z*10){
        if(a+b>=z){
            e++;
        }
    }
         cout<<e<<endl;
            e=1;
    }
    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


int main(){
	for (string a, b; cin >> a >> b; ) {
		reverse(all(a));
		reverse(all(b));
		if (a.size() < b.size() ) swap(a, b);
		int u = 0;
		rep(i, b.size()) u = (a[i] - '0' + b[i] - '0' + u) / 10;
		REP(i, b.size(), a.size() - 1) u = (a[i] - '0' + u) / 10;
		cout << a.size() + u << endl;
	}
	
	return 0;
}

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

int main(){

	int a[2];
	cin >> a[0] >> a[1];
	int check=a[0]+a[1],retval=1;
	while(check>=10){
		check/=10;
		retval++;
	}
	cout << retval << endl;

    return 0;
}

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

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

int getDigit(int num){
    int digit = 0;
    while(num != 0){
        num /= 10;
        digit++;
    }
    return digit;
}

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

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

int main(){
int a,b;

while(scanf(" %d %d",&a,&b)){
int cnt=1;
for(int i=1;i<8;i++){
if(a+b-i*10<0)break;
cnt++;
}

cout << cnt << endl;

return 0;
}

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

int main(void)
{
	int32_t first  = 0;
	int32_t second = 0;

	while( std::cin >> first )
	{
		std::cin >> second;

		std::cout << static_cast<int32_t>(std::log10(first + second))+1 << std::endl;
	}

	return 0;
}

C++: // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  ll a, b;
  while(cin >> a && cin >> b){
    cout << (to_string(a + b).size()) << endl;
  }
	return 0;
}

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

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

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

int main(){
  int a,b;
  int an[1000];
  int con[1000];
  int i=0,j,k;

  while(cin>>a>>b){
    an[i] =a + b;
    con[i] = 1;
    while(an[i]>1){
      an[i] /= 10;
      con[i]++;
    }
    i++;
      }
  for(j=0;j<i;j++){
    cout<<con[j]<<endl;
  }

  return 0;

}

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

using namespace std;

int main()
{
	int a, b, i;
	
	cin >> a >> b;
	
	a += b;
	
	for(i = 1;; i++){
		a = a / 10;
		if(a < 10){
			break;
		}
	}
	
	cout << i+1 << endl;
}

C++: #include <iostream>
#include<string>
#include<math.h>
#include<stdio.h>
#include <algorithm>
using namespace std;
int main(void){
    // Here your code !

int a,b,n;
while(cin>>a>>b){

n=a+b;
n=log10(n)+1;

cout<<n<<endl;
}
return 0;
}