Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func Sliceconvtoi() []int {
	strs := strings.Split(sc.Text(), " ")

	var ints []int
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		ints = append(ints, x)
	}

	return ints
}

func main() {
	for sc.Scan() {
		i := Sliceconvtoi()
		fmt.Println(int(math.Log10(float64(i[0]+i[1]))) + 1)
	}

}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	int a = 0, b = 0;
	int v;
	int i = 0;
	while (scanf("%d %d",&a,&b)!= EOF){
		int c = a + b;
		if (a + b < 10){
			cout << "1" << endl;
		}
		else if (a + b < 100){
			cout << "2" << endl;
		}
		else if (a + b < 1000){
			cout << "3" << endl;
		}
		else if (a + b < 10000){
			cout << "4" << endl;
		}
		else if (a + b < 100000){
			cout << "5" << endl;
		}
		else if (a + b < 1000000){
			cout << "6" << endl;
		}
		else{
			cout << "7" << 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() {
  ll a,b;
  while(cin >> a >> b){
    a += b;
    int count = 1;
    rep(i,0,6){
       if((a /= 10) > 0){
         a /= 10;
         count++;
       }
    }
    printf("%d",count);
  }
  return 0;
}

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

int main(){
int a,b;

while(scans(" %d %d",&a,&b){
int cnt=1;
for(int i=1;i<8;i++){
if(a+b-i*10<0)break;
cnt++;
}

cout << ont << endl;

return 0;
}

C++: #include <iostream>
using namespace std;
void digitNumber()
{
	int a, b;
	while (cin >> a)
	{
		cin >> b;
		int sum = a + b;
		int count = 0;
		while(sum > 0)
		{
			sum /= 10;
			count++;
		}

		cout << count << endl;
	}
}


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

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

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

int main(int argc, const char *argv[]) {
    for (int a, b; std::cin >> a >> b; ) {
        std::cout << (int)(std::log10((double)a + b) + 1) << std::endl;
    }
    return 0;
}

C++: 

#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
using namespace std;

#define nln        puts("")                         ///printnewline
#define getint(a)  scanf("%d",&a);
#define max3(a,b,c) max(a,max(b,c))                  ///3 ta theke max
#define min3(a,b,c) min(a,min(b,c))                  ///3 ta theke min

#define FOR1(i,n)  for(int i=1;i<=n;i++)
#define FOR0(i,n)  for(int i=0;i<n;i++)                 ///looping
#define FORR(i,n)  for(int i=n-1;i>=0;i--)
#define ALL(p)     p.begin(),p.end()

#define SET(p)     memset(p,-1,sizeof(p))
#define CLR(p)     memset(p,0,sizeof(p))            ///memset
#define MEM(p,v)   memset(p,v,sizeof(p))

#define READ(f)    freopen(f, "r", stdin)           /// file
#define WRITE(f)   freopen(f, "w", stdout)

#define SZ(c)      (int)c.size()
#define PB(x)      push_back(x)                     ///STL defines
#define MP(x,y)    make_pair(x,y)
#define ff         first
#define ss         second

#define LI         long int
#define LLI        long long int
#define f64        long double
#define PI         acos(-1.0)                        ///PI er value

int Set(int N,int pos){return N=N | (1<<pos);}
int reset(int N,int pos){return N= N & ~(1<<pos);}
bool check(int N,int pos){return (bool)(N & (1<<pos));}
void CI(int &_x)
{
    scanf("%d",&_x);
}

void CO(int &_x)
{
    cout<<_x;
}

template<typename T> void getarray(T a[],int n)
{
    for(int i=0; i<n; i++) cin>>a[i];
}
template<typename T> void printarray(T a[],int n)
{
    for(int i=0; i<n-1; i++) cout<<a[i]<<" ";
    cout<<a[n-1]<<endl;
}

const double EPS=1e-9;                              ///constatnts
const int INF=0x7f7f7f7f;

int dr8[8]= {1,-1,0,0,1,-1,-1,1};            ///8 direction move
int dc8[8]= {0,0,-1,1,1,1,-1,-1};
int dr4[4]= {0,0,1,-1};                      ///4 direction move
int dc4[4]= {-1,1,0,0};                      ///or adjacent dir.
int kn8r[8]= {1,2,2,1,-1,-2,-2,-1};          ///knight moves
int kn8c[8]= {2,1,-1,-2,-2,-1,1,2};


int main()
{
    //READ("input.txt");
    //WRITE("output.txt");
    int a,b;
    while(cin>>a>>b){

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

    sum=sum/10;
    ans++;
    }
    cout<<ans<<"\n";

    }
    return 0;
}

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

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

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
/*
#define _CRT_SECURE_NO_WARNIGS
#pragma warning(disable:4996)
*/
using namespace std;
typedef long long I;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)

int mo[10];

int f(int a){
	int l(0);
	while (a){
		a /= 10;
		l++;
	}

	return l;
}

int main()
{
	int a, b;
	while (scanf("%d %d",&a,&b)+1){
		cout << f(a+b) << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

int main()
{
	int a, b;
	char buf[1024];

	while ( fgets( buf, sizeof( buf ) - 1, stdin ) != NULL )
	{
		if ( buf[0] == '\n' )
			return 0;

		sscanf( buf, "%d %d", &a, &b );
		printf("%d\n", ( int )( log10( a + b ) + 1 ) );
	}

	return 0;
}

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

int main(){
	int cnt,a,b;
	while(scanf("%d %d",&a,&b)!=EOF){
		cnt=1;
		for(int i=10;;i*=10){
			if((a+b)/i==0){
				std::cout<<cnt<<'\n';
				break;
			}
			cnt++;
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    long long x,y,z;
    int count;
    while(cin >> x >> y){
        z = x + y;
        count=1;
        while(z/=10){
            count++;
        }
        cout<<count<<"\n";
    }
}

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

int main(void){
    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*****/
#include <iostream>
#include <fstream>

/*****デバッグ定義*****/
//#define DEBUG
/*****マクロ定義*****/

/*****名前空間*****/
using namespace std;

/*****グローバル変数置き場*****/

/*****その他関数置き場*****/

/*****main関数*****/
int main(){
	/*****ファイルオープン*****/
#ifdef DEBUG
	ofstream fout("output.txt");
	ifstream fin("input.txt");
	if(!fout || !fin){
		cout << "Can't open the file.\n";
		return;
	}
#endif
	/*****変数置き場*****/
	int int_a,int_b;
	int num;
	while(1){
		num = 0;
		cin >> int_a >> int_b;
		int_a += int_b;
		while(int_a / 10 != 0){
			int_a = int_a / 10;
			num++;
		}
		cout << num+1 << endl;
	}
	/*****処理部*****/

	/*****処理終了後*****/
#ifdef DEBUG
	fout.close();
	fin.close();
#endif
	return 0;
}

C++: mergesort(A[],B[])
{
   i=0,j=0;
   while i<=l1 && j<=l2
   {
   	  if A[i]<B[j] then C.push(A[i]);i++;
		           else C.push(B[j]);j++; 
   }	
   if (i<l1) while(i<=l1) C.push(A[i++]);
   if (j<l2) while(j<=l2) C.push(B[j++]);
}