Go: package main

import (
	"fmt"
	"strconv"
)

func main() {
	result := make([]int, 0, 200)

	for {
		var a, b int
		scanCount, _ := fmt.Scanf("%d %d", &a, &b)
		if scanCount == 2 {
			result = append(result, a+b)
		} else {
			break
		}
	}

	for _, v := range result {
		length := len(strconv.Itoa(v))

		fmt.Println(length)
	}
}

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

C++: #include <stdio.h>
#include <math.h>
int main(){
  int i,j,k;
  for(;;){
    scanf("%d %d",&i,&j);
    k=i+j;
    for(i=1;i<7;i++){
      if(k<pow(10,i)){
        printf("%d\n",i);
        break;
      }
    }
  }
}

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

C++: #include<stdio.h>

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

C++: #include <iostream>

using namespace std;
int main()
{
	int a,b;
	while (1){
		cin >> a;
		if (a == EOF) break;
		cin >> b;
		if (b == EOF) break;
		cout << a + b << endl;
	}
}

C++: #include <iostream>
  
using namespace std;  
  
// ??\???  
int a, b;  
  
void solve()  
{  
    int res = 0;  
  
    a += b;  
  
    for (; a; a /= 10)  
        res++;  
  
    cout << res << endl;  
}  
  
int main()  
{  
    while (cin >> a >> b)  
        solve();  
  
    return 0;  
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define REP(i,e) for (int i = 0; i != int(e); i++)
#define FORIT(i, A) for (auto i : A)
#define ISEQ(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << endl
#define SZ(x) ((int)(x).size())

int main(int argc, char const *argv[])
{

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

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

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

C++: //-------------
//include
//-------------
#include <map>
#include <list>
#include <cmath>
#include <vector>
#include <string>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
//-------------
//typedef
//-------------
typedef long long LL;
typedef  vector<int> VI;
typedef  string STR;
typedef  pair<int, int> PII;
typedef  vector<int, int> VII;
typedef  map<string, int> MSI;
//-------------
//utillty
//-------------
#define ALL(a)  (a).begin(),(a).end()
#define MK make_pair
#define PB push_back
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define COUT(a) cout<<a<<endl
//-------------
//repetition
//-------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
//-------------
//debug
//-------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define dumpl(c) REP(i,SZ(c))cerr<<#c<<i<<"="<<(c[i])<<endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const int MOD = 1000000007;
int main()
{
	int a, b;
	while (cin >> a>> b)
	{
		int x = a + b;
		int count = 1;
		while (x >= 10)
		{
			x = x/10;
			count++;
		}
		COUT(count);
	}
#ifdef _DEBUG
	while(1);
#endif // _DEBUG

	return 0;
}

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

int main(){
	int a,b,c;
	string ss;
	while(cin>>a>>b){
		c=a+b;
		ss=to_string(c);
		c=ss.length();
		cout<<c<<endl;
	}
	return 0;
}

C++: #include <iostream>

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

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;
  }

  ofstream ofs("out2.txt");
  for(int i=0;i<=10000;i++){
    ofs << string(200000,'?') << endl;
  }

return 0;
}

C++: #include <iostream>
using namespace std;
int main( void )
{
	while (1)
	{
		int a, b;

		if ( cin.eof() )
			break;

		cin >> a >> b;
		int sum = a + b;

		int cnt = 0;
		while ( sum >= 10 )
		{
			sum /= 10;
			cnt++;
		}
		
		int kotae = cnt + 1;
		cout << kotae << endl;

	}
	return 0;
}

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

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

using namespace std;

void solver() {
    int a,b;
    while(cin>>a>>b){
        cout<<a+b<<endl;
    }
}

int main() {
    solver();
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(int argc, char const* argv[])
{
	int a,b,c;

	cin >> a >> b;

	int i;
	c = a + b;
	for( i = 0;(c /= 10) != 0;i++ );

	cout << ++i << endl;
	return 0;
}

C++: /* AOJ0002 */
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main(){
  int a, b, sum;
  while(cin >> a >> b){
    sum = a + b;
    switch(sum){
    case 0 ... 9:
      cout << 1 << endl;
      break;
    case 10 ... 99:
      cout << 2 << endl;
      break;
    case 100 ... 999:
      cout << 3 << endl;
      break;
    case 1000 ... 9999:
      cout << 4 << endl;
      break;
    case 10000 ... 99999:
      cout << 5 << endl;
      break;
    case 100000 ... 999999:
      cout << 6 << endl;
      break;
    default:
      cout << 7 << endl;
    }
  }
  return 0;
}

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

int main(){
        int a, b;
        while(scanf("%d %d", &a, &b)){
                double temp = log10(a + b) + 1 ;
                cout << floor(temp) << endl;
        }
        return 0;
}

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

}

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


int main(){

int i,d,n1,n2,sum,c;

int a,b;

while(cin >> n1 >> n2){
    if(n1 == -1 or n2 == -1)  break;
   while(n1 < 0 or n1 > 1000000 or n2 < 0 or n2 > 1000000){
      cin >> n1 >> n2;
   }
   if(n1 >= 0 and n1 <= 1000000 and n2 >= 0 and n2 <= 1000000){
       a=n1;
       b=n2;
       c=0;
       sum=a+b;
       while((sum/10)!=0){
           c++;
           sum=sum/10;
        }
       cout << c+1 << "\n";
   }
}
return 0;
}