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>

int main(void){
while (!std::cin.eof()){
int a,b,c,i;
std::cin >> a >> b;
c=a+b;

while(!(c/=10))
i++;

std::cout << i << std::endl;
}

C++: #include <iostream>


using namespace std;

int main(){
	int a;
	int b;
	

	for (int i = 0; i <= 201; i++){
		cin >> a >> b;
		int  c = a + b;
		if (c >= 0 && c < 10){
			cout << "1" << endl;
		}
		else if (c >= 10 && c < 100){
			cout << "2" << endl;
		}
		else if (c >= 100 && c < 1000){
			cout << "3" << endl;
		}
		else if (c >= 1000 && c < 10000){
			cout << "4" << endl;
		}
		else if (c >= 10000 && c < 100000){
			cout << "5" << endl;
		}
		else if (c >= 100000 && c < 1000000){
			cout << "6" << endl;
		}
		else if (c >= 1000000 && c < 10000000){
			cout << "7" << endl;
		}
	}
	
	return 0;
}

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

using namespace std;

int main()
{
	int a[200], b[200], n, ans[200], p = 0;
	for (int i = 0; i < 200; i++) 
	{
		cin >> a[i] >> b[i];
		ans[i] = 0;
		n = a[i] + b[i];
		while (n >= 1) 
		{
			n /= 10;
			ans[i]++;
		}
		p++;
	}
	for (int j = 0; j < p; j++) {
		cout << ans[j] << endl;
	}
}

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

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

   	int a,b,c,ans;

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

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <set>
#include <queue>

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,b,n) for(int i=b;i<n;i++)

const float PI = 3.1415926;
static const int INFTY = (1<<30);

using namespace std;

typedef long long ll;
typedef long double ld;

ll n, a, b, res;

int main() {
  while(cin >> a, a != EOF) {
    cin >> b;
    n = a+b;
    if(n %10 == 0) n++;
    res = 0;
    
    while(n>0) {
      n /= 10;
      res++;
    }
    cout << res << endl;
  }

  return 0;
}

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

using namespace std;

int main(){
	int i,j,k,ans=0;

	
	while(cin >> i >>j ){
	k=i+j;
	while(k!=0){ k/=10; ans++;}
        cout << ans << endl;
		ans=0;

}
}

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

int get_digit(int num);

int main(){

	while (1){
		int a, b;
		cin >> a >> b;
		if (cin.eof()){
			break;
		}
		cout << get_digit(a + b) << endl;
	}

	return 0;
}

int get_digit(int num){

	if (num / 10 != 0){
		return 1 + get_digit(num / 10);
	}
	return 1;
}

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

int main(){

	int n,m;


	while(cin >> n){
		cin >> m;
		n+=m;
		cout << ((int)log10(n)+1) << endl;
	}
}

C++: #include <iostream>
#include <cmath>
#include <array>
#include <vector>

template<class T>
T input()
{
	T val;
	std::cin >> val;
	return val;
}

int main()
{
	std::vector<int> a;
	for (int i = 0; i < 200; ++i){
		a.push_back(input<int>() + input<int>());
		std::cout << static_cast<int>(log10(a[i])) << std::endl;
	}
	return 0;
}

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

int get_digit(int num);

int main() {
	int first;
	int second;
	int data_cnt = 0;
	std::vector<int> inputs;

	while ((cin >> first >> second) || (data_cnt < 200)) {
		data_cnt++;
		inputs.push_back(first + second);
	}

	for (int i = 0; i < data_cnt; i++) {
		cout << get_digit(inputs[i]) << endl;
	}

	return 0;
}

int get_digit(int num) {
	return std::to_string(num).length();
}

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

C++: #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

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

C++: #include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main( void ){
    int a[200],b;
    int i = 0;
    while( scanf( "%d %d",&a[i],&b ) != EOF ){
         a[i] = a[i] + b;
         i++;
    }
    for( int j = 0;j < i;j++ ){
        int n = 1;
        int nCount = 0;
        while( a[i] / n >= 1 ){
            n *= 10;
            nCount++;
        }
        printf( "%d\n",nCount );
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

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

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="71";
	
	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
//-------------
#include <map>
#include <list>
#include <cmath>
#include <vector>
#include <string>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
//-------------
//typedef
//-------------
typedef long long LL;
typedef  vector<int> VI;
typedef  string STR;
typedef  pair<int, int> PII;
typedef  vector<int, int> VII;
typedef  map<string, int> MSI;
//-------------
//utillty
//-------------
#define ALL(a)  (a).begin(),(a).end()
#define MK make_pair
#define PB push_back
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define COUT(a) cout<<a<<endl
//-------------
//repetition
//-------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
//-------------
//debug
//-------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define dumpl(c) REP(i,SZ(c))cerr<<#c<<i<<"="<<(c[i])<<endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const int MOD = 1000000007;
int main()
{
	int a, b;
	while (cin >> a>> b)
	{
		STR c = to_string(a + b);
		COUT(c.length());
	}
#ifdef _DEBUG
	while(1);
#endif // _DEBUG

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <math.h>
using namespace std;
int main(){
	int a,b;
	int sum=0;
	int count=0;
	vector<int> digits;
	for(int i=0;i<200;i++){
	 cin >> a >> b;
	 sum = a + b;
	 digits.push_back(log10(sum)+1);
	}
	for(int i=0; i<digits.size();++i){
		cout << digits[i] << endl;
	}
	vector<int>().swap(digits);
	return 0;

}

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

auto main () -> int
{
    int x , y;
    while (std::cin >> x >> y)
    {
        std::cout << static_cast < int > (std::log10 (x + y)) + 1 << std::endl;
    }
}

C++: #include <iostream>

int main(){
  int a, b, c;
  int i = 1;
  int num = 0;
  
  std::cin >> a;
  std::cin >> b;
  
  c = a + b;
  while(1){
    if(c/i!=0){
      num++;
      i *= 10;
    }else{
      break;
    }
  }
  std::cout << num << std::endl;
  
  return 0;
}