Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	//sc.Split(bufio.ScanWords)
	for sc.Scan() {
		s := strings.Split(sc.Text(), " ")
		n1, _ := strconv.Atoi(s[0])
		n2, _ := strconv.Atoi(s[1])
		fmt.Printf("%d\n", len(strconv.Itoa(n1+n2)))
	}
}

C++: #include<iostream>
using namespace std;
int main (){
    int a[1000000],b[1000000];
    for(int i=0;i<200;i++){
        cin>>a[i]>>b[i];
        if(a[i]+b[i]<10){
        cout<<"1"<<endl;
        }
        else if(a[i]+b[i]<100){
        cout<<"2"<<endl;
        }
        else if(a[i]+b[i]<1000){
            cout<<"3"<<endl;
        }
        else if(a[i]+b[i]<10000){
            cout<<"4"<<endl;
        }
        else if(a[i]+b[i]<100000){
            cout<<"5"<<endl;
        }
        else if(a[i]+b[i]<1000000){
            cout<<"6"<<endl;
        }
        else if(a[i]+b[i]==1000000){
            cout<<"7"<<endl;
        }
    }
    return 0;
}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
 
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
 
const double EPS = 1e-10;
const double PI = acos( -1.0 );
 
int a, b;

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

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
using namespace std;
int main() {
  int A, B, ans = 1;
  while (cin >> A >> B) {
    int L = A + B;
    ans = 1;
    for (int i = 0;; i++) {
      L /= 10;
      if (L == 0)
        break;
      ans++;
    }
    cout << ans << endl;
  }
}

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

int main(){
	vector<int> sum;
	int a, b;
	while (cin >> a >> b) sum.push_back(a + b);
	for_each(sum.begin(), sum.end(), [](int i) {
				if (i == 0) {
					cout << i << endl;
				} else {
					cout << static_cast<int>(log10(i)) + 1 << endl;
				}
			});
	return 0;
}

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

int main()
{
    int a, b;
    while (1) {

        cin >> a >> b;
        if (a == 0 && b == 0)
            break;
        int c = a + b;
        int ans = 0;
        while (c != 0)
        {
            c /= 10;
            ans++;
        }
        cout << ans << endl;
    }
    return 0;
}

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

int main(){
  int x, y;

  while(1){
    cin >> x >> y;
    cout << to_string(x + y).size() << endl;
    if(cin.eof()) {break;}
  }

  return 0;
}

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

int main() {
  char x, y;
  while(true) {
    cin >> x >> y;
    if(x == '\0') {
      break;
    }
    cout << (int)x + (int)y << endl;
  }
}

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

int main(){
    vector<int> a(3),b(3);
    for(int i=0;i<3;i++){
        cin >> a[i];
        cin >> b[i];
    }
    for(int i=0;i<3;i++){
        int c = 1;
        int s = a[i] + b[i];
        while(s >= 10){
            s /= 10;
            c++;
        }
        cout << c << endl;
    }
}

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

int f(int c){
	int d = 1;
	
	while(c >= 10){
		c = c/10;
		d++;
	}
	
	cout << d << endl;
	return 0;
}

int main() {
	int i;
	for(i=0; i < 3; i++){
		int a;
		int b;
		cin >> a;
		cin >> b;
		
		int c = a + b;
		f(c);
	}
	
	return 0;
}

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

int main(void){
	int a,b,T,c,d,e,f,g,h,i,A=0;
	while(cin>>a>>b){
		T=a+b;
		
		c=T/1000000;
		if(c>=1) A=A+1;
		
		d=T/100000;
		if(d>=1)A=A+1;
		
		e=T/10000;
		if(e>=1)A=A+1;
		
		f=T/1000;
		if(f>=1)A=A+1;
		
		g=T/100;
		if(f>=1)A=A+1;
		
		h=T/10;
		if(h>=1)A=A+1;
		
		i=T/1;
		if(i>=1)A=A+1;
		
		cout<<A<<endl;
	}
	return 0;
}

C++: #import<cstdio>
int main(){int a,b,s;while(scanf("%d%d",&a,&b)!=EOF){a+=b,s=0;while(a>0,s++,a/=10);printf("%d\n",s);}}

C++: #include <iostream>
#include <string>   
using namespace std;
 
int main(){
int a[2],i = 0,b,c = 1;

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

}

C++: #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  int A, B;
  int C;
  vector<int> ans;
  while(cin>>A>>B){
    C = A+B;
    int i=1;
    int ten=1;
    while(true){
      if(C/ten==0){
        cout<<i-1<<endl;
        break;
      }
      else{
        ten *= 10;
        i++;
      }
    }
  }
}

C++: #include <cstdio>
  
#define MAX 1000000
#define MIN 0
#define SIZE 200
  
int main() {
 int i,j;
 int a,b;
 int cnt = 0;
 int buf = 0;
 int sets[SIZE];
  
 while(scanf("%d %d",&a,&b) != EOF) {
  if((a < MIN) || (b > MAX)) {
   continue;
  }
   
  sets[cnt] = a + b;
  ++cnt;
 }
 
 for(i = 0;i <= cnt;++i) {
  for(j = MAX;j >= MIN;) {
   if((sets[i] / j) != 0) {
    ++buf;
    sets[i] -= (sets[i] / j) * j;
   }
   
   j /= 10;
  }
   
  buf = 0;
 }
 
 for(i = 0;i <= cnt;++i) {
  printf("%d\n",sets[i]);
 }
 
 return 0;
}

C++: #include <stdio.h>

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

C++: #include <iostream>
 
u_int getDigit(u_int n){
    u_int digit = 0;
     
    while(n > 0){
        n /= 10;
        ++digit;
    }
     
    return digit;
}
   
int main(){
    u_int a, b;
     
    while(std::cin >> a >> b){
        std::cout << getDigit(a + b) << std::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 <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>

using namespace std;

int main (int argc, char *argv[]) {
    int a, b;
    while (scanf("%d %d", &a, &b)) {
        int sum = a + b;
        string str = to_string(sum);
        cout<<str.length()<<endl;
    }
    return 0;
}