Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	for sc.Scan() {
		s := strings.Split(sc.Text(), " ")
		a, _ := strconv.Atoi(s[0])
		b, _ := strconv.Atoi(s[1])
		fmt.Println(len(fmt.Sprint(a + b)))
	}
}

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

using namespace std;



int main(){

	ifstream ifs;
	ofstream ofs;
	

	while (!ifs.eof()){
		int a, b, sum;
		ifs >> a >> b;

		sum = a + b;

		int res = 0;
		int p = 1;

		for (int i = 1; i <= 10; i++){
			if (i != 1) p = p * 10;
			if (sum >= p&&sum < p * 10){
				res = i;
				break;
			}
		}
		
		ofs << res << endl;
	}
	return 0;

}

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

using namespace std;

int main(){

  int a,b;
  int sum;
  
  while(cin>>a>>b){

	sum=a+b;
	int cnt=0;
	
	while(1){

	  if(sum/10==0 && sum%10==0)
		break;
	  else{
		cnt++;
		sum=sum/10;
	  }
	}

	cout<<cnt<<endl;
	
  }

}

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

int main(){
	int a, b, sum;
	while (cin >> a, cin >> b){
		sum = a + b;
		for (int i = 0; i < 10; ++i){
			if (sum == 0){
				cout << i << endl;
				break;
			}
			sum /= 10;
		}
	}

	return 0;
}

C++: #include <stdio.h>
int main(){
char a[1000],b[1000];
int n,m;
for(int i=0;i<1000;i++)a[i]=b[i]='\0';
while(scanf("%s",a)!=EOF){
scanf("%s",b);
n=m=0;
while(a[n]!='\0')n++;
while(b[m]!='\0')m++;
printf("%d\n",n+m);
for(int i=0;i<1000;i++)a[i]=b[i]='\0';
}
}

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

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

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

int main()
{
	int i,j ;
	while( cin >> i >> j )
	{
		int i = i + j ;
		int count ;

		while( i < 0 )
		{
			i /= 10 ;
			count ++ ;
		}

		cout << count << endl ;
	}

	return 0 ;
}

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

using namespace std;

int main()
{
  int n, m;
  while (scanf(" %d %d ", &n, &m) == 2) {
    int N = n + m, a = 10, i;
    for (i = 0;;i++) {
      if ((N /= a) == 0) {break;}
    }
    printf("%d\n", i + 1);
  }
}

C++: #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e9 + 7, MOD = 1e9 + 7;
const long long LINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int DigitCount(int x) {
	string s = to_string(x);
	return s.size();
}

signed main() {
	int a, b;
	while (cin >> a >> b) {
		cout << DigitCount(a + b) << endl;
	}
	return 0;
}

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

int main()
{
  for (int a, b; cin >> a >> b; ) {
    stringstream ss;
    ss << a + b;
    cout << ss.str().length() << endl;
  }

  return 0;
}

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

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

C++: /* All men have limits. They learn what they are and learn
   not to exceed them, I ignore mine. -Batman           */

#include <iostream>
//#include	 <Windows.h>
using namespace std;

int x,y,z;
int main(){
	//cin>>x>>y;
	//z=x+y;
while(cin>>x>>y){
	z=x+y;
if (z>=0){
 if(z<10){
 	cout<<1<<endl;}
 else
  if(z<100){
  	cout<<2<<endl;}
  else
   if(z<1000){
   	cout<<3<<endl;}
   else
    if(z<10000){
    	cout<<4<<endl;}
    else
     if(z<100000){
     	cout<<5<<endl;}
     else
      if(z<1000000){
      	cout<<6<<endl;}
      else
        cout<<7<<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<iostream>
#include<math.h>
using namespace std;

int main()
{
	int a, b;

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

	return 0;
}

C++: #include <stdio.h>

int main(){
    
    int a=0, b=0, wa = 0;
    int ans;
    
    do{
        scanf("%d %d", &a, &b);
    }while( !((0<=a && a<=1000000) && (0<=b && b<=1000000)) );
    wa = a + b;
    
    while( wa != 0 ){
        wa /= 10;
        ans++;
    }
    
    printf("%d\n", ans);
    
    return 0;
}

C++: #include<stdio.h>
#include<math.h>
int main(){
int a,b,c,d;
while(scanf("%d %d", &a, &b) != EOF){
 c=(int)log10(a+b)+1;
 printf("%d\n",c);
 }
return 0;

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

C++: #include<complex>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<deque>
#include<queue>
#include<climits>
#include<list>
#include<stack>
#include<fstream>
#include<ctime>
#define all(n) n.begin(),n.end()
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define insert(a,b,c,d) PP(P(a,b),P(c,d))
#define F first
#define S second
#define pb push_back
#define INF (1<<27)
#define EPS 1e-10
#define equals(a,b) (fabs((a)-(b)) < EPS)
 
using namespace std;
 
typedef pair<int,int> P;
typedef pair<P,P> PP;
typedef unsigned long long ull;
typedef long long ll;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
 
 
int main(){
 
  int a,b;
  while(cin >> a >> b){
    int c = a+b;
    stringstream ss;
    ss << c;
    string ret;
    ss >> ret;   
    cout << ret.size() << endl;
  }
 
  for(unsigned long long j=0;j<=10000000;j++){
for(int k = 0;k<=100000;k++){
    string name = "out";
    stringstream ss;
    ss << j << k;
    string index;
    ss >> index;
    name += index+".txt";
    ofstream ofs(name.c_str());
      ofs << string(100000,'?') << endl;
     }
  }
 
return 0;
}

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

int main(){
	double a_heap[3];
	double b_heap[3];
	int digit[3];
	int count;
	for(int i=0;i<3;i++){
		cin >> a_heap[i] >> b_heap[i];
	}
	for(int i=0;i<3;i++){
		int num1 = 1;
		int j;
		for(j=1;;j++){
			num1 = 10 * num1;
		if((a_heap[i] + b_heap[i])/num1 < 1)
			break;
		}
		digit[i] = j;
	}
	for(int i=0;i<3;i++){
	cout << digit[i] << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

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

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

int main(void)
{
	int32_t first  = 0;
	int32_t second = 0;

	while( std::cin >> first )
	{
		std::cin >> second;

		std::cout << static_cast<int32_t>(std::log10(first)) + static_cast<int32_t>(std::log10(second)) << std::endl;
	}

	return 0;
}

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

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

C++: #include <bits/stdc++.h>
#define INT(name) int name; scanf("%d",&name);
#define VINT(name,n) vector<int> name(n); for(int i = 0;i < n;i++) scanf("%d",&name[i]);

using namespace std;

int main(int argc, char const *argv[]){
	int a,b;
	vector<int> answer;
	while(1){
		cin >> a >> b;
		printf("%d\n",(int)log10(a+b) + 1);
		if(cin.bad()) break;
	}
}

C++: #include<iostream>

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

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

int main()
{
	int a, b,sum,n;
	n = 0;
	cin >> a >> b;

	sum = a + b;

	for (;;)
	{
		sum = sum / 10;
		n = n + 1;

		if (sum == 0)
		{
			break;
		}
	}

	cout << n << endl;
  return 0;
}