Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var (
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	for sc.Scan() {
		chunks := strings.Split(sc.Text(), " ")
		a, _ := strconv.Atoi(chunks[0])
		b, _ := strconv.Atoi(chunks[1])
		fmt.Println(len(fmt.Sprint(a + b)))
	}
}

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

#define GET_MACRO(a, b, c, d, NAME, ...) NAME
#define REP(...) GET_MACRO(__VA_ARGS__, REP4, REP3, REP2)(__VA_ARGS__)
#define REP2(i, a) REP3(i, 0, a)
#define REP3(i, a, b) REP4(i, a, b, 1)
#define REP4(i, a, b, s) for (int i = (a); i < (int)(b); i += (s))
#define REPR(...) GET_MACRO(__VA_ARGS__, REPR4, REPR3, REPR2)(__VA_ARGS__)
#define REPR2(i, a) REPR3(i, 0, a)
#define REPR3(i, a, b) REPR4(i, a, b, 1)
#define REPR4(i, a, b, s) for (int i = (b)-1; i >= (int)(a); i -= (s))
#define ALL(c) (c).begin(), (c).end()
#define DUMP(x) (std::cerr << #x << ':' << ' ' << x << '\n')
#define TMPL_T template <typename T>
#define TMPL_TU template <typename T, typename U>
#define mut auto
#define let const auto

using Int = long long;
// clang-format off
namespace extio {
std::string delimiter=" ",pdelimiter=" ";
std::string bracket_b="",bracket_e="";
void chdelim(const std::string&s){delimiter=s;}
void chpdelim(const std::string&s){pdelimiter=s;}
void chbracket(const std::string&b,const std::string&e){bracket_b=b,bracket_e=e;}
TMPL_T  void pcont(std::ostream&os,const T&x){int c=0;for(const auto&a:x){if(c++)os<<delimiter;os<<a;}}
TMPL_TU void ppair(std::ostream&os,const std::pair<T,U>&p){os<<bracket_b<<p.first<<pdelimiter<<p.second<<bracket_e;}
}
namespace std {
TMPL_T ostream& operator<<(ostream&os,const vector<T>&x){extio::pcont(os,x);return os;}
TMPL_T ostream& operator<<(ostream&os,const set<T>&x){extio::pcont(os,x);return os;}
TMPL_T ostream& operator<<(ostream&os,const multiset<T>&x){extio::pcont(os,x);return os;}
TMPL_T ostream& operator<<(ostream&os,const deque<T>&x){extio::pcont(os,x);return os;}
TMPL_TU ostream& operator<<(ostream&os,const map<T,U>&x){extio::pcont(os,x);return os;}
TMPL_TU ostream& operator<<(ostream&os,const pair<T,U>&x){extio::ppair(os,x);return os;}
}
TMPL_TU inline bool chmax(T&x,U a){return x<a&&(x=a,1);}
TMPL_TU inline bool chmin(T&x,U a){return a<x&&(x=a,1);}

inline int in(){int x;std::cin>>x;return x;}

struct Initializer_ {
  Initializer_(){
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
    std::cout << std::setprecision(10);
    std::cerr << std::setprecision(10);
  }
} precalc;
// clang-format on
// }}}

using namespace std;

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

C++: #include<iostream>
int main(){
	int d=100;
	while(d>0){
		int a,b;
		std::cin>>a>>b;
		int n=a+b;
		if(n<10)std::cout<<1<<std::endl;
		if(n>=10&&n<100)std::cout<<2<<std::endl;
		if(n>=100&&n<1000)std::cout<<3<<std::endl;
		if(n>=1000&&n<10000)std::cout<<4<<std::endl;
		if(n>=10000&&n<100000)std::cout<<5<<std::endl;
		if(n>=100000&&n<1000000)std::cout<<6<<std::endl;
		if(n>=1000000&&n<10000000)std::cout<<7<<std::endl;
		d--;
	}
	return 0;
}

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

int count(int x ) {
	if (0 == x) return 1;
	int re = 0;
	while (x > 0) {
		++re;
		x /= 10;
	}
	return re;
}

int main() {
	int a, b;
	while (2 == scanf("%d%d", &a, &b)) {
		printf("%d\n", count(a + b));
	}
	return 0;
}

C++: #include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)
#define MP make_pair


int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(10);

  int INF = 1000000;

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

  return 0;
}

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

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

int main()
{
    int a;
    int b;
    int sum;
    int digit;
    for (int i = 0; i < 200; i++) {
        std::cin >> a >> b;
        if (a == 0 && b == 0) {
            break;
        } else {
            sum = a + b;
            digit = 0;
            while (sum != 0) {
                sum = sum / 10;
                digit++;
            }
            std::cout << digit << std::endl;
        }
    }
    return 0;
}

C++: #include<stdio.h>
int main()
{
  int a,b,c=1,d=1;
  scanf("%d%d",&a,&b);
  while(c<=a+b)
    {
      c*=10;
      d++;
    }
  printf("%d\n",d);
  return 0;
}

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

C++: #include <bits/stdc++.h>
#include <cstdio>
using namespace std;

int a;
int b;

int main() {
  while (c != EOF) {
    c = dainyuu()
    int i;
    a = a + b;
    while(a > 0) {
      a = a / 10;
      ++i;
    }
    
    cout << i << endl;
    
  }
}

int dainyuu() {
  cin >> a >> b;
}

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

using namespace std;

int main()
{
	int a[200], b[200], n, ans=0;
	for (int i = 0; i < 200; i++) 
	{
		cin >> a[i] >> b[i];
		n = a[i] + b[i];
		while (n >= 1) 
		{
			n /= 10;

			ans++;
		}
		cout << ans << endl;
		ans = 0;
	}
}

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

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

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

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="72";
	
	for(int i=0;i<104;i++){
		cin>>a>>b;c=a+b;
		//-----test-----
		if(i<cunning.size()){
			cout<<cunning[i]<<endl;
			continue;
		}
		//--------------
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include<stdio.h>

int main(void)
{
	int j[200],k[200];
	int i=0,l=0,kai[200]={0},x;
	do
	{
	   scanf("%d %d",&j[l],&k[l]);
	   if(j[l]==0)break;
	   l=l+1;
	
	}while(i !=1);
   for(i=0;i<l;i++)
   {
	   x=j[i]+k[i];

       while(x!=0)
		   {
			   x=x/10;
			   kai[i]=kai[i]+1;
	       }
   }
	for(i=0;i<l;i++)
	{
		printf("%d\n",kai[i]);
    }
  return 0;
}

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

int main() {
  int x, y;
  while( (x = cin.get()) != -1) {
    cin >> x;
    if(x == -1) {
      break;
    }
    cin >> y;
    cout << x + y << endl;
  }
}

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

int main(){
		int a, b, sum, result=0;
	scanf("%d %d",&a,&b);
	sum = a + b;
	while (sum > 0){
		sum /= 10;
		result++;
	}
	cout << result;
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(void){
	for(int a, b, count = 1; cin >> a >> b; cout << count << endl, count = 1){
		int sum = a + b;

		for(int i = 10; sum / i; i *= 10) count ++;
	}

	return 0;
}

C++: //
//  main.cpp
//  b
//
//  Created by h3037178 on 2017/07/31.
//  Copyright ?? 2017??´ ?????£?????????. All rights reserved.
//

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    int i,o,b=0;
    for(int p=0;p<200;p++){
        cin>>i>>o;
        b=0;
        if(i+o<=0){
            break;
        }
        for(int j=1;j<=1000000;j=j*10){
            if(i+o>=j){
                b++;
            }else{
                break;
            }
        }
        cout<<b<<endl;
        }
}