Go: package main

import (
	"fmt"
	"strconv"
)

func main() {
	result := make([]int, 0, 200)

	for {
		var a, b int
		scanCount, _ := fmt.Scanf("%d %d", &a, &b)
		if scanCount == 2 {
			result = append(result, a+b)
		} else {
			break
		}
	}

	for _, v := range result {
		length := len(strconv.Itoa(v))

		fmt.Println(length)
	}
}

C++: #include <array>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iterator>
#include <tuple>
#include <utility>
#include <limits>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdint>
#include <cassert>

using namespace std;

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

int main()
{
    int a, b;
    while(cin >> a >> b) {
        int l = static_cast<int>(log10(a+b));
        cout << l+1 << "\n";
    }

    return 0;
}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
 
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
 
const double EPS = 1e-10;
const double PI = acos( -1.0 );
 
int a, b;

int main() {
    while ( scanf( "%d %d", &a, &b ) != EOF ) {
        a += b;
        int ans = 0;
        while ( true ) {
            if ( a / 10 == 0 && a % 10 == 0 ) {
                break;
            }
            ans++;
            a /= 10;
        }
        printf( "%d\n", ans );
    }
    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>

int main() {
	int a, b, sum, digit;

	while (1) { 
		digit = 0;
		scanf("%d %d", &a, &b);
		sum = a + b;
		while (sum > 0) {
			sum /= 10;
			digit++;
		}
		printf("%d\n", digit);
	}

	return 0;
}

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

C++: #include<iostream>
using namespace std;
int main(){
int a,b,i,c=0;
cin>>a>>b;
a=a+b;
for(i=1;i<10000000000;i*=10){
	if(a/i==0)break;
	c++;
}

cout<<c<<endl;
return 0;
}

C++: #include <stdio.h>

int ketasu(int num){
	if(num == 0) return 0;
	int i;
	for(i = 1; num != 0; i++){
		num /= 10;
	}
	return i;
}
int main(){
	int a, b;
	while(scanf("%d %d", &a, &b) == EOF){
		printf("%d\n",ketasu(a + b));
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
#include<complex>
using namespace std ;
typedef vector<int> vi ;
typedef vector<vi> vvi ;
typedef vector<string> vs ;
typedef pair<int, int> pii; 
typedef long long ll ;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()

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

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

int main() {
	// your code goes here
	int a,b;
	while(cin >> a >> b){
		char s[100];
		sprintf(s,"%d",a+b);
		cout << strlen(s) << endl;
	}
	return 0;
}

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

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

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

int hoge(int sum,int cnt){
	if(sum/10<=9) return cnt;
	else return hoge(sum/10,++cnt);
}

int main(){
	while(true){
		int a,b;
		cin>>a>>b;
		if(a+b<10) cout<<1<<endl;
		else cout<<hoge(a+b,2)<<endl;
	}
	return 0;
}

C++: #include <stdio.h>

void solve(int a){
	int ans = 0;
	while (a > 0){
		ans ++;
		a /= 10;
	}
	printf("%d\n", ans);
}

int main (){
	int a, b;
	while (~scanf("%d%d", &a, &b)){
		solve(a+b);
	}
	return 0;
}

C++: #include<iostream>

int main(){
	int a,b,c,i,n;
	
	while(std::cin>>a>>b){
		c=a+b;
		n=0;
		i=1;
		while(i<=c){
		n++;
		i=i*10;
		}
	std::cout<<n<<std::endl;
		}

    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	int a, b;

	while (cin >> a >> b) {
		int sum = a + b;
		int n;
#if 0
		for (n = 0; sum > 0; n++) {
			sum /= 10;
		}
		cout << n << endl;
#else
		if        (sum >= 10000000) {	n = 8;	 
		} else if (sum >= 1000000) {	n = 7;	
		} else if (sum >= 100000) {		n = 6;	
		} else if (sum >= 10000) {		n = 5;	
		} else if (sum >= 1000) {		n = 4;	
		} else if (sum >= 100) {		n = 3;	
		} else if (sum >= 10) {			n = 2;	
		} else if (sum >= 1) {			n = 1;	
		} else {						n = 0;
		}
		cout << n << endl;
	
#endif
	}
	return 0;
}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
 
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
 
const double EPS = 1e-10;
const double PI = acos( -1.0 );
 
int a, b;

int main() {
    while ( scanf( "%d %d", &a, &b ) != EOF ) {
        a += b;
        int ans = 0;
        while ( true ) {
            if ( a / 10 == 0 && a % 10 == 0 ) {
                break;
            }
            ans++;
            a /= 10;
        }
        printf( "%d\n", ans );
    }
    return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int num[2];
	int numLength = sizeof(num) / sizeof(num[0]);
	int i = 0;
	int n;
	int sum;
	while(i < 200){
		n = 1;
		sum = 0;
		
		int h;
		for(h = 0; h < numLength; h++)
		{
			cin >> num[h];
			sum += num[h];
		}
		
		while(sum/10 != 0){
			n++;
			sum = sum / 10;
		}
		
		cout << n << endl;
		i++;
	}
	return(0);
}

C++: #include<bits/stdc++.h>

using namespace std;

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

  int sum = a + b;

  while(1){
    sum = sum / 10;
    ans++;
    if(sum == 0){
      break;
    }
  }

  cout<<ans<<endl;

  return 0;
}