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<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;
	}
	}

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;
		++ans[cou];
		if (sum!=0){
			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<sstream>
#include<string>
#include<vector>
using namespace std;

int main() {

	vector<int> ans;
	int a, b;
	//int cnt = 0;

	while (1) {
		cin >> a >> b;
		if (cin.eof()) { break; }
		ans.push_back(a + b);
	}

	for (int i = 0; i < ans.size(); i++)
	{
		string str = to_string(ans[i]);
		cout << str.size() << endl;
	}

	return 0;
}

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

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

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <memory>
#include <functional>
using namespace std;
int main(){
	int a,b;
	while(cin>>a>>b){
		int ans=1;
		int cnt=a+b;
		while(cnt>=10){
			cnt/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
#define Vi vector<int>
#define Vl vector<long long>
#define pb(a) push_back(a)

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef pair<double,Pi> Pdi;
typedef pair<ll,int>Pli;
typedef pair<P1,ll> P2;
const ll INF=100000000001;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
struct Road{double cost;int a,b;};
struct edge{int to,cost;};
struct pos{
	int x,y,cost;
};
int main() {

	rep(i,200){
		ll a,b;
		cin>>a>>b;
		if(cin.eof())break;
		ll t=a+b,ans=1;
		while(t/10>0){
			t/=10;
			ans++;
		}
		cout<<ans<<endl;
	}

	return 0;
}

C++: dataset = STDIN.read.split("\n").map do |data|
    data.split(" ")
end.map do |data|
  data.map(&:to_i)
end

dataset.each do |data|
    puts  (data[0] + data[1]).to_s.size
end

C++: #include <iostream>

using namespace std;

int main() {

	const int num=3;
	int a, b;

	while(cin >> a >> b) {

		int sum = a + b;
		int keta = 1;
		while (1) {
			if (sum >= 10) {
				keta++;
				sum /= 10;
			}
			else {
				break;
			}
		}

		cout << keta << endl;

	}

	return 0;

}