Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
	"unicode/utf8"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	var strs []string
	var a, b, sum int64
	var digits int
	for scanner.Scan() {
		strs = strings.Split(scanner.Text(), " ")
		a, _ = strconv.ParseInt(strs[0], 10, 64)
		b, _ = strconv.ParseInt(strs[1], 10, 64)

		sum = a + b
		// goでlen(string)はbyte数が返る
		digits = utf8.RuneCountInString(strconv.FormatInt(sum, 10))

		fmt.Printf("%d\n", digits)
	}
}

C++:   1 #include<iostream>
  2 #include<stdio.h>
  3 using namespace std;
  4 int main(){
  5          
  6            int a,b;
  7              while(scanf("%d %d",&a,&b) != EOF){
  8                        int i = 0;
  9                          a = a + b; 
 10                            while(a > 0){
 11                                        a = a / 10;
 12                                            i++;
 13                                                  } 
 14                                                   
 15                                                     cout << i << endl;
 16                                                            
 17                                                        }   
 18 }

C++: #define _USE_MATH_DEFINES

#include <iostream>
#include <string>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

using namespace std;

int main()
{
	int a, b;
	for (; cin >> a >> b;)
	{
		cout << ::to_string(a + b).length() << endl;
	}
}

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

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

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

int main(){
	int a, b, at, bt;
	
loop:
	if(feof(stdin)) goto end_scope;
	scanf("%d %d\n", &a, &b);		// データセット
	{
		stringstream ss;
		ss << a+b;
		cout << ss.str().length() << endl;
	}
	goto loop;
end_scope:
    return 0;
}

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

int main() {
	while (true) {
		int a, b;
		cin >> a >> 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>
#include<cmath>
using namespace std;

int main()
{
	float a,b;
	int i=256;
	while(i){
		cin>>a;
		cin>>b;
		cout<<(int)log10(a+b)+1<<endl;
		i--;
	}
}

C++: #include<iostream>
using namespace std;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int x,y,z,count=1;
    cin >> x >> y;
    z = x + y;
    while(z/=10){
        count++;
    }
    cout<<count<<"\n";
}

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

int main() {
	int cnt = 0;
	char a;
	while (getchar()!= '\n') {
		cnt++;
	}
	while (getchar() != '\n') {
		cnt++;
	}
	cout << cnt<<endl;
	return 0;
}

C++: #include<cstdio>

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

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="776755555555555555555555555555555555555555555";
	
	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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class itr, class func> void array_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr, class func> void nint_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += string(out(*i)) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcount(n)

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

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

int a, b;

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

  return 0;
}

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

int main()
{
	int a,b;
	while(cin>>a>>b){
		int k=1,stac=a+b;
		while(stac>=10){
			stac/=10;
			k++;
		}
		cout<<k<<"\n";
	}
}

C++: #include <stdio.h>
#include <string.h>

int main(){
	int a,b;
	char str[256];
	while(scanf("%d%d", &a, &b) != EOF){
		sprintf(str, "%d", a+b);
		printf("%d\n", strlen(str));
	}
}

C++: #include <iostream>
#include <cstdio>
#define KETAMAX (15)
#define SETMAX (200)
using namespace std;
int main(void){
    
    int a[SETMAX] = {0};
    int b[SETMAX] = {0};
    int keta[SETMAX] = {0};
    int SetCount = 0;
    int ret = 0;
    char Dumy[KETAMAX] = {'\0'};
    
    while(1){
        
        ret = scanf("%d%d",&a[SetCount],&b[SetCount]);
        
        if(ret == EOF){
            break;
        }
        
        keta[SetCount] = sprintf(Dumy,"%d",(a[SetCount] + b[SetCount]));
        SetCount++;
    }
    
    for(int i = 0; i < SetCount; i++){
        printf("%d\n",keta[i]);
    }
    
    return(0);
}

C++: #include <iostream>

using namespace std;

int main(){
	
	int a,b;
	
	while(cin >> a >> b){
		
int n = a+b;
int ans = 1;
int s = 10;
while(n >= s){
s *= 10;
ans++;
}
	cout << ans <<endl;
	}
	}