Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func Sliceconvtoi() []int {
	strs := strings.Split(sc.Text(), " ")

	var ints []int
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		ints = append(ints, x)
	}

	return ints
}

func main() {
	for sc.Scan() {
		i := Sliceconvtoi()
		fmt.Println(int(math.Log10(float64(i[0]+i[1]))) + 1)
	}

}

C++: #include <iostream>

int main(int argc, const char * argv[]) {
    
    using namespace std;
    int a;
    int b;
    int sum;
    int flag = 0;
    int count = 0;
    
    cin >> a >> b;
    
    sum = a + b;
    
    while (!flag) {
        sum = sum / 10;
        count++;
        if(sum < 1) flag = 1;
    }
    
    cout << count;
    
    return 0;
}

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

#include <string>
#include <sstream>

namespace patch
{
    template < typename T > std::string to_string( const T& n )
    {
        std::ostringstream stm ;
        stm << n ;
        return stm.str() ;
    }
}

#include <iostream>
int main(){
	int i,j;
	string s;
while(cin>>i>>j){
	cout<<patch::to_string(i+j).length()<<endl;
}
    return 0;
}

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

C++: #include <stdio.h>

int main(){

	int a=0,b=0,x=0;

	while (scanf("%d%d", &a, &b)!=EOF){
		
		if (a + b < 1000000){
			printf("6\n");
		}else if(a + b < 100000){
			printf("5\n");
		}else if (a + b < 10000){
			printf("4\n");
		}else if (a + b < 1000){
			printf("3\n");
		}else if (a + b < 100){
			printf("2\n"); 
		}else if (a + b < 10){
			printf("1\n",x);
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a,b;
  int k=0;
  int s=0;
  int i;
  int ke[999]={0};
  while(cin>>a>>b){
  s=a+b;
  while(s>=1){
    s=s/10;
    ke[k]++;
  }
  k++;
}
  for(i=0;i<=k;i++){
  cout<<ke[i]+1<<endl;
}
  return 0;
}

C++: #include<iostream> 
#include<cstdio> using namespace std; int main() { int a,b; while(scanf("%d%d",&a,&b)!=EOF) { int x=a+b; int cnt=0; while(x) { cnt++; x/=10; } printf("%d\n",cnt); } return 0; }

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>

using namespace std;

typedef long long int lld;

const lld mod = 1e9+7;
const lld INF = 1e9;
//const lld MAXN = 1e9;

int main()
{
	int a,b;
	while(cin>>a>>b)
	{
		int cnt = 0;
		a += b;
		while(a>0)
		{
			cnt++;
			a /= 10;
		}

		cout << cnt << endl;
	}

	return 0;
}

C++: /* All men have limits. They learn what they are and learn
   not to exceed them, I ignore mine. -Batman           */
#include <bits/stdc++.h>
//#include <iostream>
//#include <vector>
//#include <Windows.h>
using namespace std;

int main(){
long long int a,b,gg;
while(cin>>a>>b){
	gg=a+b;
	gg=log10(gg)+1;
	cout<<gg<<endl;
}

return 0;
}

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

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

int main(){
const int INF=10000000;
int a,b,c,ans;
while(cin>>a>>b){
ans=1;
a+=b;
for(i=0;i<INF;i++){
c=a%10
a-=c
if(a=0){break;}
if(a!=0){
ans++;
a/=10;}}
cout<<ans;}}

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 <cmath>
#include <iostream>
using namespace std;

int digits(unsigned long p){
    if(p == 0) return 1;
    return (int)(log10l(p) + 1);
}

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

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="776755555555555555555555555555555555555554555555555555555555555555555555555555555555555555";
	
	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 <bits/stdc++.h>

using namespace std;

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

C++: #include <iostream>

int main(){
	int a, b ,i ,n ;
	while(std::cin>>a>>b){
	i=1;
	for(n=1;a+b>=i*10;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 num=1;
   int c=a+b;
   while(c/10!=0){
     num++;
      c/=10;
   }
   cout<<num<<endl;
 }
 return 0;
}

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

int main() {
    int a, b;

    while (cin >> a) {
        cin >> b;
        string sum = to_string(a + b);
        cout << sum.length() << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main()
{
    int f,s;
    while (cin >> f >> s)
    {
        cout << to_string(f+s).length() << endl;
    }
}

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