Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		row := strings.Split(scanner.Text(), " ")
		var sum int
		for _, v := range row {
			num, _ := strconv.Atoi(v)
			sum += num
		}
		fmt.Println(len([]rune(strconv.Itoa(sum))))
	}
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#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 CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = {-2};

void input() {
	int i = 0;

	

	return;
}


int main(void) {
	input();
	int i = 0;
	int sum = 0;
	int numb = 0;
	int a = 0;
	int b = 0;

	while ((scanf_s("%d%d",&a,&b)) != EOF) {
		sum = a + b;
		while (sum != 0) {
			numb++;
			sum /= 10;
		}
		CO numb E
		numb = 0;
	}



	return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <iterator>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) container.begin(), container.end()
#define RALL(container) container.rbegin(), container.rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int a, b;

main(){
	while(cin >> a >> b){
		cout << (a+b?(int)log10(a+b+EPS):1) << endl;
	}
	return 0;
}

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

int main() {
	ios :: sync_with_stdio(false);
	int a, b;
	while(cin >> a >> b) {
		int n = a + b;
		int ans = 0;
		if(n == 0)
			ans = 1;
		else {
			while(n) {
				ans ++;
				n /= 10;
			}
		}
		cout << ans << '\n';
	}
	return 0;
}

C++: #include <stdio.h>

int main(){

long a,b,i,n;

while(scanf("%ld",&a)!=EOF){

scanf("%ld",&b);

n = a+b;

for(i=1;i<10;i++){

 n = n%10;

if(n==0) break;

}

printf("%ld",n);

}


}

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

int main(void){
	int a,b;
	while(scanf("%d %d",&a,&b)!=EOF){
		printf("%d\n",(int)log10((double)a+b)+1);
	}
}

C++: #include<stdio.h>
int main()
{
int x,y,cou,w;
cou=0;w=0;
for(int i=0;i<=200;i++){
w=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 <stdio.h>
#include <stdlib.h>
#include <string.h>

char *itoa( int val, char *a, int radix )
{
	char *p = a;
	unsigned int v = val;/* 作業用(変換対象の値) */
	int n = 1;/* 変換文字列の桁数記憶用 */
	while(v >= radix){/* 桁数を求める */
		v /= radix;
		n++;
	}
	p = a + n; /* 最下位の位置から設定する */
	v = val;
	*p = '\0';/* 文字列終端の設定 */
	do {
		--p;
		*p = v % radix + '0';/* 1桁の数値を文字に変換 */
		if(*p > '9') {/* 変換した文字が10進で表現できない場合 */
			*p = v % radix - 10 + 'A'; /* アルファベットを使う */
		}
		v /= radix;
	} while ( p != a);
	return a;
}

int main(void) {
	int sum,x,y;
	char ssum[8];
	
	while(scanf("%d%d", &x, &y) != EOF){
		sum = x+y;
		itoa(sum,ssum,10);
		printf("%d\n",strlen(ssum));
	}
	
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<stdio.h>
#include<string>
using namespace std;
int main() {
	long x,y,i, j=0,k=0, a, b;
	while (cin >> a >> b) {
		x = a + b;
		while (1) {
			j++;
			x /= 10;
			if (x == 0) {
				y = j;
				j = 0;
				break;
			}
		}
		cout << y << endl;
		
	}

	return 0;
}

C++: #include <stdio.h>

int main(){

long a,b,i,n;

while(scanf("%ld",&a)!=EOF){

scanf("%ld",&b);

n = a+b;

for(i=1;i<10;i++){

 n = n%10;

if(n==0) break;

}

printf("%ld\n",n);

}


}

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

int main()
{
	int a,b,c;
	cin >>a >>' '>>b;
	c = a+b;
	int ret = 1;
	for(int i=1;;i++){
		if( c/pow(10,i)){
			ret++;
		}else{
			break;
		}
	}
	cout <<ret <<endl;
		
	return 0;
}

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

int main()
{
	int a,b,c;
	char str[16];
	while(cin >> a >> b){
		c = sprintf(str,"%d",a+b);
		cout << c << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
int main(int argc, const char * argv[])
{
    int a, b, ab = 0, ans;
    
    while(scanf("%d %d", &a, &b) != EOF){
        if (a < 0 || 1000000 < a) {
            while (a < 0 || 1000000 < a) {
                scanf("%d %d", &a, &b);
            }
        }
        if (b < 0 || 1000000 < b) {
            while (b < 0 || 1000000 < b) {
            scanf("%d %d", &a, &b);
            }
        }
        ab = a + b;
        ans = 0;
        while (ab) {
            ans++;
            ab /= 10;
        }
        printf("%d\n", ans);
    }
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define N 200
int main(int argc, const char * argv[])
{
    double x1=0;
    double x2=0;
    //int a[N][2];
    //int b[N];
    while(scanf("%lf",&x1) != EOF){
        scanf("%lf",&x2);
        int y=x1+x2;
        int z=1;
        y=y*(0.1);
        while(y>=1){
            z++;
            y=y*(0.1);
        }
        
        printf("%d\n",z);
        
    }
}

C++: #include <stdio.h>

int main(){

long a,b,i,n;

while(scanf("%ld",&a)!=EOF){

scanf("%ld",&b);

n = a+b;

for(i=1;i<10;i++){

 n = n/10;

if(n==0) break;

}

printf("%ld\n",n);

}


}

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

int main() {
  int a, b;

  while(cin >> a >> b) {
    cout << (int)(log10(a+b) + 1) << endl;
  }
  return 0;
}

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

int dig(long long total);
int dig(long long total)
{  if(total<10)
       return 1;
    else
        return (1 + dig(total/10));
    
}

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

do{
cin>>a;
cin>>b;

}while(a<0 || a>1000000 || b<0 || b>1000000);

    long long total = a+b;

return 0; 
}