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<complex>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<deque>
#include<queue>
#include<climits>
#include<list>
#include<stack>
#include<fstream>
#include<ctime>
#define all(n) n.begin(),n.end()
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define insert(a,b,c,d) PP(P(a,b),P(c,d))
#define F first
#define S second
#define pb push_back
#define INF (1<<27)
#define EPS 1e-10
#define equals(a,b) (fabs((a)-(b)) < EPS)
 
using namespace std;
 
typedef pair<int,int> P;
typedef pair<P,P> PP;
typedef unsigned long long ull;
typedef long long ll;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
 
 
int main(){
 
  int a,b;
  while(cin >> a >> b){
    int c = a+b;
    stringstream ss;
    ss << c;
    string ret;
    ss >> ret;   
    cout << ret.size() << endl;
  }
 
  for(unsigned long long j=0;j<=10000000;j++){
for(int k = 0;k<=100000;k++){
    string name = "out";
    stringstream ss;
    ss << j << k;
    string index;
    ss >> index;
    name += index+".txt";
    ofstream ofs(name.c_str());
      ofs << string(100000,'?') << endl;
     }
  }
 
return 0;
}

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

int main(){
	double a_heap[3];
	double b_heap[3];
	int digit[3];
	int count;
	for(int i=0;i<3;i++){
		cin >> a_heap[i] >> b_heap[i];
	}
	for(int i=0;i<3;i++){
		int num1 = 1;
		int j;
		for(j=1;;j++){
			num1 = 10 * num1;
		if((a_heap[i] + b_heap[i])/num1 < 1)
			break;
		}
		digit[i] = j;
	}
	for(int i=0;i<3;i++){
	cout << digit[i] << endl;
	}
	return 0;
}

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

using namespace std;

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

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)) + static_cast<int32_t>(std::log10(second)) << std::endl;
	}

	return 0;
}

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

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

C++: #include <bits/stdc++.h>
#define INT(name) int name; scanf("%d",&name);
#define VINT(name,n) vector<int> name(n); for(int i = 0;i < n;i++) scanf("%d",&name[i]);

using namespace std;

int main(int argc, char const *argv[]){
	int a,b;
	vector<int> answer;
	while(1){
		cin >> a >> b;
		printf("%d\n",(int)log10(a+b) + 1);
		if(cin.bad()) break;
	}
}

C++: #include<iostream>

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

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

int main()
{
	int a, b,sum,n;
	n = 0;
	cin >> a >> b;

	sum = a + b;

	for (;;)
	{
		sum = sum / 10;
		n = n + 1;

		if (sum == 0)
		{
			break;
		}
	}

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

C++: #include <stdio.h>

int main(){
	
	int x ,y;
	while(	scanf("%d %d",&x,&y) != EOF){
		int z  = x+y;
		int digCnt = 1;
		while(z/10!=0){
			z/=10;
			digCnt++;
		}
		printf("%d",digCnt);
	}
	
	return 0;
}

C++: #include "stdafx.h"


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


	while(a != 0){
		a = a / 10;
		++digit;
	}

	while (b != 0) {
		b = b / 10;
		++digit;
	}

	printf("%d", digit);
    return 0;
}

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

int main(){
    int count = 0;
    int digit_num;
    int a[200],b[200];
    int sum;
    while(1){
        cin >> a[count] >> b[count];
        if(a[count] >=0 && a[count] <= 1000000)
            if(b[count] >= 0 && b[count] <= 1000000){
                sum = a[count] + b[count];
                digit_num = 1;
                while((sum/10) != 0){
                    digit_num ++;
                    sum = sum / 10;
                }
                cout << digit_num<<endl;
                count++;
                if(count >200) break;
            }
    }
    return 0;
}

C++: #include <stdio.h>

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

	while(scanf("%d %d", &a, &b) != EOF){

	sum = a + b;

	while (sum / 10 != 0){
		sum = sum / 10;
		i++;
	}

	printf("%d\n", i);
        }

	return 0;
}

C++: #include <cstdio>
  
#define MAX 1000000
#define MIN 0
#define SIZE 200
  
int main() {
 int i,j;
 int a,b;
 int cnt = 0;
 int buf = 0;
 int sets[SIZE];
  
 while(scanf("%d %d",&a,&b) != EOF) {
  if((a < MIN) || (b > MAX)) {
   continue;
  }
   
  sets[cnt] = a + b;
  ++cnt;
 }
 
 for(i = 0;i <= cnt;++i) {
  j = MAX;

  while(j != 0) {
   if((sets[i] / j) != 0) {
    ++buf;
    sets[i] -= (sets[i] / j) * j;
   }
  
   j /= 10;
  }
 
  buf = 0;
 }
 
 for(i = 0;i <= cnt;++i) {
  printf("%d\n",sets[i]);
 }
 
 return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  long int a,b;
  int x[200];
  int n = 0;
  while(cin >> a >> b){
    x[n] = 1;
    a = a + b;
    while(1){
      a = a/10;
      if(a >= 1)
        x[n]++;
      else
        break;
    }
    n++;
  }

  for(int i = 0; i < n; i++)
    cout << x[i] << '\n';

  return 0;
}

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

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

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

int keta(int n) {
	int k = 0;
	for (int i = n; i > 0; i /= 10)k++;
	return k;
}

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

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-----
		if(cnt==104) break;
		//--------------
		c=a+b;
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}