Go: package main

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

func sliceAtoi(sa []string) ([]int, error) {
	si := make([]int, 0, len(sa))
	for _, a := range sa {
		i, err := strconv.Atoi(a)
		if err != nil {
			return si, err
		}
		si = append(si, i)
	}
	return si, nil
}

func getDigits(ary []int) (digits int) {
	sum := 0
	for _, v := range ary {
		sum += v
	}

	for sum != 0 {
		sum /= 10
		digits++
	}
	return
}

func getsTwoNumAsArray() (nums [][]int) {
	scanner := bufio.NewScanner(os.Stdin)

	for scanner.Scan() {
		str := scanner.Text()
		if str == "" {
			break
		}

		ary, _ := sliceAtoi(strings.Split(str, " "))
		nums = append(nums, ary)
	}

	return
}

func main() {
	ary := getsTwoNumAsArray()

	for _, v := range ary {
		fmt.Println(getDigits(v))
	}
}

C++: #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>

using namespace std;
using Int = long long;
typedef pair<int,int> Pi; typedef pair<Int,Int> Pl;
constexpr int mod = 1e9+7;
constexpr int INF32 = numeric_limits<int>::max();
constexpr Int INF64 = numeric_limits<Int>::max();
#define END {cout<<ans<<'\n'; return 0;}
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define Pr(t) priority_queue<t>
#define gPr(t) priority_queue<t,vector<t>,greater<t>>
#define V(t) vector<t>
#define rer(i,l,r) for(int(i)=(l); (i)<(r); ++(i))
#define rep(i,n) rer(i,0,n)
#define gnr(i,l,r) for(int (i)=(r)-1; (i)>=(l); --(i))
#define pri(a) cout<<(a)<<'\n'
#define pri2(a,n) {rep(i,n-1)cout<<a[i]<<' '; if(n)cout<<a[n-1]<<'\n';}
#define prip(p) cout<<(p).fi<<' '<<(p).se<<'\n'
template<class T> inline bool cmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool cmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int n,m,_,x,y,q;
string s,sb;
bool ok;
char cf,cb;

int main(){
  cin.tie(nullptr); ios::sync_with_stdio(0);
  //cout<<fixed<<setprecision(20);
  
  while(cin>>s){
    cin>>sb; pri(to_string(stoi(s)+stoi(sb)).size());
  }
}

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

int main(){
    int i, j;
    int a,b,c;
    std::vector<int> avec, bvec;
    for (i = 0; i <= 200; i++){
        scanf("%d %d", &a, &b);
        c = a + b;

        std::string str = std::to_string(c);
        std::cout << str.length() << "\n";
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <iterator>
#include <cmath>
#include <stack>
#include <functional>
using namespace std;

 
int main()
{
  int a,b;
  while(cin >> a >> b, !cin.eof()) {
    stringstream ss;
    ss << (a + b);
    string str = ss.str();
    cout << str.size() << endl;
  }
  return 0;
}

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

C++: #include <stdio.h>

int main(void){
	int a,b;
	int sum;
	int loop_i,loop_j;
	int cnt=0;

	while(1){
		sum = 0;
		fscanf(stdin,"%d %d",&a,&b);
		sum = a+b;
		do{
			sum = sum/10;
			cnt++;
			if(sum == 0)
				break;
		}while(1);
		printf("%d\n",cnt);
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main (){
    int a[1000000],b[1000000];
    for(int i=0;i<200;i++){
        cin>>a[i]>>b[i];
        if(a[i]+b[i]<10){
        cout<<"1"<<endl;
        }
        else if(a[i]+b[i]<100){
        cout<<"2"<<endl;
        }
        else if(a[i]+b[i]<1000){
            cout<<"3"<<endl;
        }
        else if(a[i]+b[i]<10000){
            cout<<"4"<<endl;
        }
        else if(a[i]+b[i]<100000){
            cout<<"5"<<endl;
        }
        else if(a[i]+b[i]<1000000){
            cout<<"6"<<endl;
        }
        else if(a[i]+b[i]<10000000){
            cout<<"7"<<endl;
        }
    }
    return 0;
}

C++: 
#include <iostream>

int main(int argc, const char * argv[]) {
    
    int a, b ;
    
    
    while ( std::cin >> a >> b )
        std::cout << std::to_string(a+b).length() << "\n";
    
    return 0;
}

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

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);

   	int a,b,c,ans;

	while(1){
		cin >> a >> b;
   		c = a + b;
   		ans = (int)log10((double)c) + 1;
   		cout << ans << "\n";
	}

}

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

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

C++: #include <iostream>

using namespace std;

int a, b, ans;

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

C++: #include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;

#define MAX 256

int main(void){

	int a, b, c[MAX], t = 0;
	int i = 0, s;

	while (t == 0){
		c[i] = 0;
		scanf("%d%d", &a, &b);
		s = a + b;
		while (s >= 10){
			c[i]++;
			s = s / 10;
		}
		i++;
	}

	for (int j = 0; j < i; j++){
		printf("%d", c[j]);
	}

	return 0;
}

C++: #include <iostream>  
using namespace std;  
  
// üÍ  
int a, b;  
  
void solve()  
{  
    int res = 0;  
  
    a += b;  
  
    for (; a; a /= 10)  
        res++;  
  
    cout << res << endl;  
}  
  
int main()  
{  
    while (cin >> a >> b)  
        solve();  
  
    return 0;  
}

C++: #include <iostream>
using namespace std;
int main(){
	int a, b;
	while(1){
		cin>>a>>b;
		if (cin.eof())
			break;
		a+=b;
		b=0;
		while(a){
			a/=10;
			b++;
		}
		cout<<b<<endl;

	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
	    int a,b;
	    while(cin>>a>>b)
	    {
		string c=to_string(a+b);
		cout<<c.length()<<endl;
	}
}

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

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

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i >= _##i poi i--)
#define downtil(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i > _##i poi i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

#define poi ;
#define poipoi << "\n"

using namespace std;

int main(){
    int a, b poi
    while(cin >> a >> b){
        int sum = a + b, i = 0 poi
        while(sum){
            sum /= 10 poi
            i++ poi
        }
        cout << i poipoi poi
    }
    return 0 poi
}

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

int main() {
	int a[3],b[3];
	int ans[3];
	for(int i=0; i<3; i++) scanf("%d %d", &a[i], &b[i]);

	int cnt;
	int keta[3] = {0,0,0};
	for(int i=0; i<3; i++) {
		cnt = a[i] + b[i];
		while(cnt >= 10) {
			cnt/=10;
			keta[i] ++;
		}
		keta[i]++;
	}

	printf("%d\n%d\n%d\n", keta[0], keta[1], keta[2]);

	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
	
	int a, b, c;
	int count;
	
	for (;cin >> a >> b;){
		c = a + b;
		for(count = 0; c != 0; count++){
			c = c / 10;
		}
		cout << count << endl;
	}
	
	return 0;
}

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

int main(void){

  int num,num1,num2,count;

  while(cin >> num1 >> num2){
    num = num1 + num2;
    count = 0;
    while(num >= 10){
      num = num / 10;
      count++;
    }

    cout << count + 1 << endl;
  }
  return 0;

}