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++: //#define _GRIBCXX_DEBUG
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;


// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion


// Effective std
#pragma region ESTD
template<typename C, typename T>
constexpr int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F>
constexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T, typename U>
constexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U>
constexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C>
constexpr void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred>
constexpr void sort(C& c, Pred p) { sort(ALL(c), p); }
template<typename C>
constexpr void reverse(C& c) { reverse(ALL(c)); }
#pragma endregion


// ?´???°
#pragma region PRIME
bool is_prime(unsigned n) {
  switch(n) {
    case 0:
    case 1: return false;
    case 2: return true;
  }
  if (n%2==0) return false;
  for (unsigned i=3; i*i<=n; i+=2)
    if (n%i==0) return false;
  return true;
}
#pragma endregion


// ??§??????/?°?????????????
#pragma region TRANSFORM
void mutal_tr(string &s) {
  for(int i=s.size(); i--;) {
    if(islower(s[i])) s[i] = toupper(s[i]);
    else if (isupper(s[i])) s[i] = tolower(s[i]);
  }
}
void to_upper(string &s) { for(int i=s.size(); i--;) s[i] = toupper(s[i]); }
void to_lower(string &s) { for(int i=s.size(); i--;) s[i] = tolower(s[i]); }
#pragma endregion


// ??????
#pragma region SET
template<class T>
set<T> intersection(const set<T>& sa, const set<T>& sb) {
  set<T> ret;
  for(T a : sa) if(sb.find(a) != sb.end()) ret.insert(a);
  return ret;
}
#pragma endregion

// Union Find
#pragma region UF
struct UnionFind {
  vector<int> data;
  UnionFind(int size) : data(size, -1) {}
  bool union_set(int x, int y) {
    x = root(x); y = root(y);
    if(x!=y) {
      if(data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool find_set(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};
#pragma endregion


// ?????°
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#pragma endregion

int main() {
    int a, b;
    while(cin >> a >> b) {
        string sum = to_string(a + b);
        P(sum.length());
    }
  return 0;
}

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

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

C++: #include <iostream>
#include<vector>
#include<stdlib.h>
#include<algorithm>
#include<string>
using namespace std;



int main(void){

	int a, b,sum=0,count;

	for (;;){//??°????????????????????°?????????
		count = 0;
		cin >> a >> b;
		sum = a + b;
		if (a==NULL || !a)break;

		do{
			sum /= 10;
			count++;

		} while (sum / 10 != 0);
		//?????°???count?????°
		cout << count+1 << endl;

	}
	return 0;
}

C++: #include <cstdio>
using namespace std;
int toLowUnder10(int arg) {
	return (10 > arg) ? arg : (toLowUnder10(arg/10) + 1) ;
}

int main (int argc, char *argv[]) {
	int a,b;
	while (EOF != fscanf(stdin, "%d %d", &a, &b)) {
		printf("%d\n", toLowUnder10(a+b));
	}
	return 0;
}

C++:  #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 
 using namespace std;
 
 int compare(int a,int b)
 {
   return a>b;    
 }

 int main()
 {
   int m,n;
   while(cin>>m>>n)
   {
     int sum=m+n;
     int count=0;
     while(sum)
     {
       count++;
       sum/=10;          
     }
     cout<<count<<endl;                
   }
   //while(1);      
   return 0;    
 }

C++: #define scanf_s scanf
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAX 200
int main(void)
{
	int a, b, i, sum, cou = 0;
	int ans[MAX] = { 0 };
	while (scanf_s("%d %d", &a, &b) != EOF) {
		sum = a + b;
		if (sum != 0){
			++ans[cou];
			while (1) {
				if (sum <= 1) break;
				sum /= 10;
				++ans[cou];
			}
		}
		++cou;
	}
	for (i = 0; i < cou; ++i) {
		if (i != 0) printf("\n");
		printf("%d", ans[i]);
	}
}

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

using namespace std;

int main(void)
{
	vector<int> sum;
	int a, b;

	while(cin >> a >> b){
		sum.push_back(a+b);
	}

	for(int x : sum){
		int d = 1;
		x /= 10;
		while(x > 0){
			x /= 10;
			d++;
		}
		cout << d << endl;
	}

	return 0;
}

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

using namespace std;
int main() {
    int a,b;
    while(cin >> a){

        cin >> b;
        cout << (int)log10(a+b)+1 << endl;
    }
    return 0;

}

C++: #include <iostream>
int main(){
	int a,b,c;
	std::cin>>a>>b>>c;
	if(a*a==b*b+c*c){
		std::cout<<"YES"<<std::endl;
		}
	else if(b*b==a*a+c*c){
		std::cout<<"YES"<<std::endl;
		}
	else if(c*c==a*a+b*b){
		std::cout<<"YES"<<std::endl;
		}
	else std::cout<<"NO"<<std::endl;

	
		
	 return 0;
	}

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

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

C++: #include <iostream>
using namespace std;
int main()
{
	int a,b;
	while (a != EOF || b != EOF){
		cin >> a;
		cin >> b;
		cout << a + b << endl;
	}
}

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

int main() {
	int a, b;
	cin >> a;
	cin >> b;
	int sum = a + b;
	int i = 1;
	int count = 0;
	while (sum/i!=0){
		count++;
		i *= 10;
	}
	cout << count;
	return 0;
}

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

int main()
{
	int a[200],b[200],sum[200],keta[200],cnt=0,set=2,i=0;

	while( cin >> a[i] >> b[i]){
		i++;
	}

	for(i=0;i<set;i++){
		sum[i]=a[i]+b[i];
		while(sum[i]!=0){
			sum[i]=sum[i]/10;
			cnt++;
		}
		cout << cnt << endl;
		cnt=0;
	}

	return 0;
}

C++: #include<stdio.h>


int main(void){
  int a,b,c,d,e,i,j;
  int n[9999];
  j=0;  
  while(scanf(" %d %d", &a, &b)!=EOF){
   
    c=a+b;d=1;i=0;e=1;
    while(e>0){
      e=c/d;
      //      printf("%d\n",i);
      d=d*10;
      i++;}
    n[j]=i-1;
    
    //printf("input %d %d \n",a,b);
    j++;
  }
  for(i=0;i<j;i++)
    printf("%d\n",n[i]);
	   return 0;
}