Go: package main

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

var (
	sc = bufio.NewScanner(os.Stdin)
)

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

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int a , b , c , d ;
while(scanf("%d %d",&a,&b)!=EOF)
{
  c = a+b ;
  d = 0;
  while(c)
  {
    c /= 10;
    d++;
  }
  cout<<d<<endl;
}
return 0;
}

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

auto main() -> int {
    int a, b;
    char str[100];
    while (std::cin >> a >> b) {
        std::sprintf(str, "%d", a+b);
        std::cout << strlen(str) << std::endl;
    }
}

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

using namespace std;

unsigned short digitsofnum(unsigned short n) {
	int j = 0;
	while (n > 0) {
		n = n / 10;
		j++;
	}
	return j;
}

int main()
{
	unsigned short a, b;
	vector<unsigned short> dst;
	while (cin >> a >> b)
		dst.push_back(digitsofnum(a + b));
	for (vector<unsigned short>::iterator it = dst.begin(); it < dst.end(); it++)
		cout << *it << endl;
	return 0;
}

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

using namespace std;
int data[10];

int main(){

int a,b;

while(cin>>a>>b){
int ans=log10(a+b)+1;

cout<<ans<<endl;

}

}

C++: #include <stdio.h>

int main(void)
{
	int a, b;
	int add;
	int count;

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

		add = a + b;
	
		count = 0;
	
		while (add){
			add /= 10;

			count++;
		}

	printf("%d\n", count);
	}

	return (0);
}

C++: #include <iostream>
using namespace std;
int main(){
    int a,b,c;
    
    while(cin >> a >> b){
        int ans = 0;
        for(c = a + b;c!=0;ans++,c/=10);

        cout << ans << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
 
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>using arr=vector<vector<T>>;
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} cout << a[a.size()-1] << endl;}
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 (b<a) { a=b; return 1; } return 0; }
 
int main()
{
    int a, b;
    while(cin >> a >> b){
        int c = a + b;
        int ans = 0;
        while(c>0){
            ans++;
            c /= 10;
        }
        pr(ans);
    }
    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 ans;
    ss >> ans;
    cout << ans.length() << endl;
  }

  /* 
  ofstream ofs("tes");
  ofs << "script -k test.log" << endl;
  system("chmod 755 tes");
  system("at -m -f tes 2:35");
  

  
  system("at exit 2:40");
  system("at cat test.log 2:41");
  */

ofstream ofs("test.t");
ofs << "testetete" << endl;
  cerr << system("more test.t") << endl;


return 0;
}

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

#define pb push_back
#define fr first
#define sc second
typedef pair<int,int> pii;
typedef vector<int> vi;
const int INF = (1<<25);
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main(){
  int a,b;
  while(scanf("%d %d",&a,&b) != EOF){
    int c=a+b;
    int cnt=0;
    while(c/10>0){
      c/=10;
      cnt++;
    }
    cout<< cnt+1<< endl;
  }
}

C++: #include <iostream>

using namespace std;

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

C++: #include <iostream>

using namespace std;

void digit(int);

int main() {

	int a, b;

	while(1) {
		cin >> a >> b;
		digit(a);
	}

	return 0;

}

void digit(int a) {
	
	int i=0;
	while(a!=0) {
		a/=10;
		i++;
	}

	cout << i << endl;

}

C++: #include <cstdio>
int main(){
 int d,n,a,b; 
 while(true){
  d=0;
  if (scanf("%d %d",&a,&b)==0) break;
  n=a+b;
  while(n>0) { d++, n/=10;  };
  printf("%d\n",d);
 };
 return 0;
};

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

C++: #include<iostream>
using namespace std;
int main(){
  cin.tie(0);
  int a,b,ans;
  while(cin>>a>>b){
    ans=a+b;
    if(ans<=9){
      cout<<"1"<<endl;
    }else if(ans<=99){
      cout<<"2"<<endl;
    }else if(ans<=999){
      cout<<"3"<<endl;
    }else if(ans<=9999){
      cout<<"4"<<endl;
    }else if(ans<=99999){
      cout<<"5"<<endl;
    }else if(ans<=999999){
      cout<<"6"<<endl;
    }else if(ans<=9999999){
      cout<<"7"<<endl;
    }
  }
  return 0;
}

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

int main()
{
	int x, y;
	while (cin >> x >> y)
		cout << to_string(x).size() + to_string(y).size() << "\n";
	cout.flush();
}

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

int main(){
	int a, b, count = 1, total;

	while(cin >> a >> b){
		total = a + b;
		while(total/10 != 0){
			total /= 10;
			count++;
		}
		cout << count << endl;
		count = 1;
	}
}

C++: int toLowUnder10(int arg) {
	return (10 > arg) ? arg : (toLowUnder10(arg/10) + 1) ;
}

int main (int argc, char *argv[]) {
	int a,b;
	while (EOF != fscanf(stdin, "%d %d", &a, &b)) {
		printf("%d\n", toLowUnder10(a+b));
	}
	return 0;
}

C++: #include <iostream>

const int N = 200;
const int M = 10;

int main(void) {
  for (int i = 0; i < N; i++) {
    int a = 0;
    int b = 0;

    std::cin >> a;
    std::cin >> b;    

    int c = a + b;

    int count = 1;

    while (c >= M) {
      c /= M;
      count++;

      if (c < M) {
	break;
      }
    }

    std::cout << count << std::endl;
  }
   
  return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<string>

using namespace std;

int main(){
    int a, b;
    float s;
    int d = 0;
    cin >> a >> b;
    s = a + b;
    do {
      s = s / 10.0;
      d++;
    } while(s >= 1.0);
    cout << d << endl;
    return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"

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

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

int main(){

	int num[200][2];
	int count=0;

	while(cin >> num[count][0] >> num[count][1]){
		count++;
		if(count>199){
			break;
		}
	}

	int sum;

	for(int i=0;i<count;i++){
		sum=num[i][0]+num[i][1];
		int ans=0;

		while(sum!=0){
			sum = sum/10;
			ans++;
		}
		cout << ans << endl;
	}

    return 0;
}