Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		i := scanner.Text()
		var total int
		inputNum := strings.Fields(i)
		for _, v := range inputNum {
			num, err := strconv.Atoi(v)
			if err != nil {
				break
			}
			total += num
		}
		fmt.Println(DigitCount(strconv.Itoa(total)))
	}
}

func DigitCount(str string) int {
	return len(str)
}

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

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

C++: #include <iostream>

const int N = 200;
const int M = 10;

int main(void) {
  int a = 0;
  int b = 0;

  while (!std::cin.eof()) {
    std::cin >> a;
    std::cin >> b;

    int c = a + b;

    int count = 1;

    while (c >= M) {
      c /= M;
      count++;

      if (c < M) {
	break;
      }
    }

    std::cout << count << std::endl;
  }
   
  return 0;
}

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

int main(int argc, char** argv)
{
  int a, b;

  while (1) {
    if (fscanf(stdin, "%d %d", &a, &b) != 2)
      break;

    fprintf(stdout, "%d\n", int(log10(a + b)) + 1);
  }
}

C++: #include <iostream>


using namespace std;

int main(){
	int a;
	int b;
	

	for (int i = 0; i < 200; i++){
		int d=0;
		cin >> a >> b;
		int  c = a + b;
		for ( d = 1; c >= 10; d++)
		{
			c = c / 10;
		}
		cout << d << endl;
	}

	return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
using namespace std;

//??°?????????????????°

void function()
{
    //??¢??°
}
 
int main(){
	int a, b;
	cin >> a >> b;
	int sum = a + b;
	int cnt = 1;
	while(true){
		sum /= 10;
		if(sum == 0){
			break;
		}
		cnt++;
	}
	cout << cnt << endl;
    return 0;
}

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

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

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

  return 0;
}

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

int main()
{
	int value,value_2;
	
	while(cin >> value >> value_2)
	{
		int count = 1;
		int sum = value + value_2;
		while(sum / 10 != 0)
		{
			sum /= 10;
			count++;
		}

		cout << count << endl;
		count == 0;
	}
	return 0;
}

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

using namespace std;

int a,b;
int s;
int Count;
int main(){
  Count = 0;
  scanf("%d %d",&a,&b);
  s = a+b;
  for(; s != 0; s/=10){
    Count++;
  }
  printf("%d",Count);
  return 0;
}

C++: #define scanf_s scanf
#include <string>
#include <stdio.h>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX 200
int main(void)
{
	int a, b, 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 (int i = 0; i < cou; ++i) {
		if (i != 0) printf("\n");
		printf("%d", ans[i]);
	}
}

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

int main() {

	int a, b, c,d;
	char e[100];

		cin >> a >> b;

		c=a+b;

		d = sprintf(e,"%d", c);

	cout << d << endl;

	return 0;
}

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

int main()

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

    }
    return 0;
}

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

int main(){

	int a, b;
	while( cin >> a >> b ){
		a = a+b;
		b = 0;

		while(a>1){
			a /= 10;
			b++;
		}
		cout << b << endl;
	}

	return 0;
}

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

int main() {
	int a, b, c, e, f;
	cin >> f;
	for (int i = 0; i <= f; i++) {
		cin >> a >> b;
		c = a + b;
		e = 1;
		while (true) {
			if (c< 10) {
				break;
			}
			c = c / 10;
			e = e + 1;
		}
		cout << e << endl;
	}
	return 0;
}

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

int main() {

    while(true){
    
        // 1. input end check.
        int a = -1, b = -1;
        cin >> a >> b;
        
        // 2. exit conditions.
        if(a == -1 && b == -1) break;
        
        // 3. output answer.
        int c = a + b;
        string ans = to_string(c);
        cout << ans.size() << endl;
    }
    
    return 0;
    
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="77675555555555555555555555555555555555555455555555555555555555555555555555555555";
	
	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 <cstdio>
using namespace std;
int main(){
  int a, b;
  char s[100];
  while(cin >> a >> b){
    a += b;
    sprintf(s, "%d", a);
    cout << strlen(s) << endl;
  }
  return 0;
}

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


int main () {

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

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

C++: #include <iostream>
using namespace std;
int solve(int a,int b){
    int sum=a+b,ans=0;
    while(sum>0){
        ans++;
        sum/=10;
    }
    return ans;
}
int main(void){
    int a[300]={},b[300]={},i=0;
    while(cin>>a[i]>>b[i]){
        cout<<solve(a[i],b[i])<<endl;
        i++;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<int>(m,0));
#define Twovec(a,n,m) vector<vector<double>> a(n,vector<double>(m,0));
#define P pair<int,int>
#define All(a) (a).begin(),(a).end()
#define Sort(a) sort(All(a));
#define Reverse(a) reverse(All(a));
#define PQ(n) priority_queue<P,vector<P>,greater<P>> (n)
#define pq(n) priority_queue<int> (n)
#define print(a) cout << (a) << endl;
#define peintD(a) cout << setprecision(10) << ans << endl;
using namespace std;
int max_int = 1000000007;
void Debug(auto a);
int nibul(auto a,auto b);
int nibuu(auto a,auto b);
void input(vector<int>& a,int n);

int n,m;

signed main(){
    while(cin >> n >> m){
        int x = n+m;
        int tmp=1;
        while(x>=10){
            x /= 10;
            tmp++;
        }
        print(tmp)
    }
    return 0;
}

void Debug(auto a){
    cout << "{ ";
    for(auto b: a){
        cout << b << " ";
    }
    cout << "}" << endl;
}
int nibul(auto a,auto b){
    int x = lower_bound(All(a),b) - a.begin();
    //key以上の初めてのitr
    return x;
}
int nibuu(auto a,auto b){
    int x = upper_bound(All(a),b) - a.begin();
    //key以下の最後のitr
    return x-1;
}

void input(vector<int>& a,int n){
    REP(i,n){
        cin >> a[i];
    }
}