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<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	int a,b,c,k,i,s;
	while(cin>>a>>b)
	{
		k=a+b;
		s=0;
		while(k!=0)
		{
			k=k/10;
			s++;
		}
		cout<<s;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <strstream.h>
#include <math.h>

using namespace std;

int main()
{
	string tmp;
	int nspace;
	do
	{
if(cin.eof()) break;
		getline(cin,tmp);
		nspace=tmp.find(" ");

		string astring=tmp.substr(0,nspace);
		string bstring=tmp.substr(nspace+1);

		istrstream astr(astring.data());
		istrstream bstr(bstring.data());

		int a,b;

		astr>>a;
		bstr>>b;

		int a_keta=(int)log10(a)+1;
		int b_keta=(int)log10(b)+1;

		cout<<a_keta+b_keta;
		
				 
	}while(1);

	
	return 0;
}

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

int main()
{
  long n1, n2;
  int ans = 0;
  cin >> n1 >> n2;
  long sum = n1 + n2;
  while(sum > 0){
    sum /= 10;
    ans++;
  }
  ans = (n1 == 0 & n2 == 0) ? 1 : ans;
  cout << ans << endl;
}

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

int main() {
	int a, b;
	while (cin >> a >> b) {
		double tmp = a + b; int keta = 0;
		while (true) {
			if (tmp < 10)break;
			tmp = tmp / 10;
			keta++;
		}
		cout << keta << 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 + second))+1 << std::endl;
	}

	return 0;
}

C++: //
//  main.cpp
//  b
//
//  Created by h3037178 on 2017/07/31.
//  Copyright ?? 2017??´ ?????£?????????. All rights reserved.
//

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    int i,o,b=0,f;
    for(int p=0;p<200;p++){
        cin>>i>>o;
        b=0;
        f=i+o;
        if(f<=0||f>2000000  ){
            break;
        }
        for(int j=1;j<=1000000;j=j*10){
            if(i+o>=j){
                b++;
            }else{
                break;
            }
        }
        cout<<b<<endl;
        }
}

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

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

int main(){

  vector<long int> array1(200,0);
  vector<long int> array2(100,0);
  vector<int>      array3(100,1);

  for(int i = 0;i<6;i++){
    cin >> array1[i];
  }

  for(int i = 0; i < 3;i++){
    array2[i] = array1[2*i] + array1[2*i+1];
  }

  for(int i = 0; i < 3;i++){
    while(array2[i] / 10 != 0){

      array3[i]++;
      array2[i] /= 10;

    }
  }

  for(int i = 0; i < 3;i++){
    cout  << array3[i] << endl;
  }


    return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="776755555555555555555555555555555555555554";
	
	for(int i=0;i<104;i++){
		cin>>a>>b;c=a+b;
		//-----test-----
		if(i<cunning.size()){
			cout<<cunning[i]<<endl;
			continue;
		}
		//--------------
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include<iostream>
int main()
{
	int result[200];
	int num;
	for(int i = 0;; i++)
	{
		int a, b;
		std::cin >> a >> b;
		if(std::cin.eof())
		{
			num = i;
			break;
		}
		for(int j = 10, k = 1;; j *= 10, k++)
		{
			if((a + b) / j == 0)
			{
				result[i] = k;
				break;
			}
		}
	}
	for(int i = 0; i < num; i++)
	{
		std::cout << result[i] << std::endl;
	}
	return 0;
}

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

#define pout(n)  printf ("%d\n", n)

#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)

const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int d8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const int d8y[8] = { 0,1,1,1,0,-1,-1,-1 };
 
typedef long long ll;
using namespace std;
 
int main() {
  int a,b;
  while(cin >> a >> b){
    a += b;
    int count = 1;
    
    while(a != 0){
       a /= 10;
      count++;
    }
    
    pout(count);
  }
  return 0;
}

C++: #include<iostream>
#include<math.h>
#include <stdlib.h>

void listen_nums(int &a,int &b);

int calc_digit(const int num);

int main()
{
	int a,b;
	
	for(;1;)
	{
		listen_nums(a,b);
		int sum=a+b;
		std::cout<<calc_digit(sum)<<std::endl;
	}
	
	return 0;
}

void listen_nums(int &a,int &b)
{
	using namespace std;
	cin>>a>>b;
	
	if(cin.eof())
	{
		exit(0);
	}
}

int calc_digit(const int num)
{
	return (int)log10((double)num)+1;
}

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

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

C++: 
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>

using namespace std;
using ll = long long;
using ull = unsigned long long;
#define out(S) cout<<(S)<<endl;
#define REP(i,b) for(size_t i=0;i<(b);i++)
#define rREP(i,b) for(int i=(b)-1;i>=0;i--)
#define FOR(i,a,b) for(size_t i=(a);i<(b);i++)
#define rFOR(i,a,b) for(int i=(b)-1;i>=0;i--)
#define Foreach(item,collection) for(auto item:collection)
#define mod(i) ((i) % (ll)(1e9 + 7))
ll modpow(ll i, ll j) { ll tmp = 1; while (j) { if (j % 2)tmp = mod(tmp*i); i = mod(i*i); j /= 2; }return tmp; }
#define divmod(a,b) (mod(a * modpow((ll)b,(ll)(1e9 + 5))))
#define Yes out("Yes")
#define No out("No")
#define NO out("NO")
#define YES out("YES")
#define INF 1e10;
#define ShowAll(collection) for(auto i:collection){out(i);}
#define IfOut(condition,text) if((condition)){out(text);return 0;}
#define IfeOut(condition,itext,etext) if(condition){out(itext);return 0;}else{out(etext);return 0;}
#define Select(collection,condition,result) Foreach(i,collection){result+=condition;}
#define GetAuto(_N,vect) {cin>>N;vect.resize(N);REP(i,_N){cin>>vect[i];}}
void removeAt(string& s, int index) { s.erase(index, 1); }
template<typename T> void removeAt(vector<T>& v, int index) { v.erase(v.begin() + index); }
ll manhattanDistance(ll x1, ll y1, ll x2, ll y2) { return (abs(x2 - x1) + abs(y2 - y1)); }


int main() {
	ll a, b;
	vector<int> ans;
	while (cin>>a>>b)
	{
		ll c = a + b;
		int cnt = 0;
		while (c)
		{
			c /= 10;
			cnt++;
		}
		ans.push_back(cnt);
	}
	Foreach(i, ans) out(i);
	return 0;
}

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

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);

   	int a,b,c,ans;

	while(cin >> a >> b;){
   		c = a + b;
   		ans = (int)log10((double)c) + 1;
   		cout << ans << "\n";
	}
	return 0;
}

C++: #include <iostream>

int main() {
  int a, b;
  int num, sum;
  while (std::cin >> a >> b) {
    num = 1;
    sum = a + b;
    while ((sum /=10) != 0)
      num += 1;
    std::cout << num << std::endl;

  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
int main(int argc, const char * argv[])
{
    int a, b, ab = 0, ans = 0;
    
    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;
        while (ab) {
            ans++;
            ab /= 10;
        }
        printf("%d\n", ans);
    }
    return 0;
}