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++: //
//  main.cpp
//  AizuOnlineJudge
//
//  Created by TomoyaYamaguchi on 2016/08/05.
//  Copyright ?? 2016??´ TomoyaYamaguchi. All rights reserved.
//

#include <iostream>

using namespace std;

int main(int argc, const char * argv[]) {
    // insert code here...
    int height[10];//?±±?????????
    int tmp = 0;
    int end = 0;
    
    for(int i=0;i<10;i++){
        cin >> height[i];
    }
    
    while(end == 0){
        end = 1;
        for(int i=0;i<9;i++){
            if(height[i] < height[i+1]){
                end = 0;
                tmp = height[i];
                height[i] = height[i+1];
                height[i+1] = tmp;
            }
        }
    }
    
    for(int i=0;i<3;i++){
        cout << height[i] << endl;
    }
    
    return 0;
}

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

using namespace std;

int main()
{
	unsigned int a, b;
	string sa,sb;
	while (cin)
	{
		cin >> a >> b;
		cout << std::to_string(a+b).size() << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define min(v,w) v>w?w:v;
#define max(v,w) v<w?w:v;
#define INF 0x3f3f3f3f3f3f3f3f
#define MAXN 30

struct p{
	int x,y;
};

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

/*
((F(TF))(TF(F(TF(TF))))(F(TF))(TF))
(TFT)
((TFT)T)

*/

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

int main(){
  int a, b, c;
  int i = 10;
  int num = 1;
  
  while(scanf("%d", &a)!=EOF){
    scanf("%d\n", &b);
    
    c = a + b;
    while(1){
      if(c/i!=0){
        num++;
        i *= 10;
      }else{
        break;
      }
    }
    std::cout << num << std::endl;
  }
  
}

C++: #include <iostream>

int main(){

  int a[200];
  int b[200];

  int i=0,A;

  while(std::cin >> A){
    a[i] = A;
    std::cin >> b[i];
    ++i;
  }
  int k;

  for(int j=0;j<i;j++){
    a[j] += b[j];
    k=0;
    do{
      a[j] %= 10;
      ++k;
    }while(a[j]!=0);

    std::cout << k << std::endl;
  }
}

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

int main(){
	long a, b;
	while (cin >> a >> b){
		for (long i = 0; i < 7; i++){
			if (a + b >= pow(10, i) && a + b < pow(10, i + 1)){
				cout << (i + 1) << endl;
			}
		}
	}
	return 0;
}

C++: #include<stdio.h>
#include<iostream.h>
using namespace std;
int main(){
	int ab[200][2],i=0,a,g,k=0;
double f=200;
	while(cin<f){
		scanf("%d %d",&ab[i][1],&ab[i][2]);
		i++;
	}
	for(int j=0;j<i;j++){
		a=ab[j][1]+ab[j][2];
		for(g=0;;g++){
			a=a/10;
			k++;
			if(a==0){
				printf("%d\n",k);
				break;
			}
		}
		k=0;
	}
	return 0;
}

C++: #include<stdio.h>


int main(){
	int a;
	int b;
	int i;
	int l=1;
	scanf("%d", &a);	
	scanf("%d", &b);
	i=a+b;
	while(i  >= 10){
		i=i/10;
		l=l+1;
	}
	printf("%d" ,l);
}

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

using namespace std;

int main()
{
	int a, b;

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

	return 0;
}

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

int main(){
	int a, b;
	while(cin >> a >> b) {
		cout << ::to_string(a + b).length() << endl;
	}
	return 0;
}

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

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

C++: 
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>


using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x*x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#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 EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
#define loop(n) FOR(i,0,n)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

int dig(int n) {
	
	int ans = 0;
	while(n > 0) {
		ans++;
		n /= 10;
	}

	return ans;
}

int main() {

	int a, b;

	while (cin>>a>>b) {

		int n = a + b;

		cout << dig(n) << endl;
	}
	return 0;
}

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

int main(){
  long a, b, c;
  int i = 10;
  int num = 1;
  
  while(scanf("%d", &a)!=EOF){
    scanf("%d", &b);
    c = a + b;
    while(1){
      if(c/i!=0){
        num++;
        i *= 10;
      }else{
        break;
      }
    }
    std::cout << num << std::endl;
  }
  
  return 0;
  
}

C++: #include "iostream"
#include "string"
#include "cmath"
using namespace std;

int main(int argc, char const *argv[])
{
  int a, b, total;
  cin >> a >> b;
  total = a+b;
  total = floor(log10(abs(total))) + 1;
  if (total < 0)cout << 0;
  else cout << total;
  return 0;
}

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

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#define REP(i,n) for(long long int (i)=0;(i)<(n);i++)


using namespace std;


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

C++: #include<string>
#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int a,b;
	cin >> a>>b;
 string x=IntToString(a+B);
cout<<x.size()<<endl;
return 0;
}
string IntToString(int number)
{
  string stream ss;
  ss << number;
  return ss.str();
}

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

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