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 <stdio.h>
#include <math.h>

#define DEBUG

#ifndef DEBUG 
#define fprintf (void)
#endif 

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

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

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



//int main(){
// int a[10];
// for(int i=0;i<10;i++){
//  cin>>a[i];
// }
// sort(a,a+10);
// for(int i=9;i>6;i--)
//  cout<<a[i]<<endl;
//return 0;
//}


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

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

C++: #include <iostream>
using namespace std;
 
int main() {
	int a,b,c;
	int n=10;
	while(cin>>a>>b){
	    c=a+b;
	    n=10;
	    for(int i = 0;i<6;i++){
 
	        if(c%n == c){
	            cout<<i+1<<endl;
	            break;
	        }
 
	        n=n*10;
	    }
	}
	return 0;
}

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

#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)

#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.first)
#define cdr(a) (a.second)
#define cadr(a) (car(cdr(a)))
#define cddr(a) (cdr(cdr(a)))
#define all(a) a.begin(), a.end()
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;

typedef long long INTEGER;
typedef double FLOAT;

template<class S, class T>
ostream& operator<<(ostream& os, pair<S,T> p) {
  os << '(' << car(p) << ", " << cdr(p) << ')';
  return os;
}

template<class T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

void swap(int*a, int*b) {
  int t = *b;
  *b = *a;
  *a = t;
}

int digit (long a) {
  if (a == 0) return 1;
  int r = 0;
  while (a > 0) {
    ++r;
    a /= 10;
  }
  return r;
}

int main() {

  int a, b;
  for (; scanf("%d", &a) != EOF; ) {
    scanf("%d", &b);
    cout << digit(a + b) << endl;
  }

  return 0;
}

C++: #include<iostream>

using namespace std;

int main() {
	long a, b;
	while (!cin.eof()) {
		cin >> a >> b;
		cout << a + b << endl;
	}

	return 0;
}

C++: #include<iostream>
int main(){
	while(1){
		int a,b;
		std::cin>>a>>b;
		int n=a+b;
		if(n<10)std::cout<<1<<std::endl;
		if(n>=10&&n<100)std::cout<<2<<std::endl;
		if(n>=100&&n<1000)std::cout<<3<<std::endl;
		if(n>=1000&&n<10000)std::cout<<4<<std::endl;
		if(n>=10000&&n<100000)std::cout<<5<<std::endl;
		if(n>=100000&&n<1000000)std::cout<<6<<std::endl;
		if(n>=1000000&&n<10000000)std::cout<<7<<std::endl;
		break;
	}
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <utility>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)

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

C++: #include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int c,g,a,b;
	while(1)
	{
		c=0;
		cin>>a>>b;
		if(a!=EOF)
			break;
		g=a+b;
		while(1)
		{
			if(g/10>=1)
				c++;	
			else 
				break;
			g/=10;
		}		
		cout<<c+1<<endl;
	}
	return 0;
}

C++: #include <stdio.h>

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

C++: #include <iostream>
#include <cstring>
#include <stdio.h>
#include <sstream>
using namespace std;

int main()
{
    int a,b;
    while(scanf("%d %d",&a,&b)!=EOF)
    {
        int sum=a+b;
        stringstream ss;
        ss << sum;
        string s1=ss.str();
        int k=s1.size();
        printf("%d\n",k);
    }
}

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>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

int main(){
	ios::sync_with_stdio(false);

	int n, m;
	int count;

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

}

C++: #include<stdio.h>
int main()
{
int x,y,cou,w;
cou=0;w=0;
for(int i=0;i<=201;i++){
cou=0;
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<iostream>
using namespace std;

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