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 <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e9 + 7, MOD = 1e9 + 7;
const long long LINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int DigitCount(int x) {
	string s = to_string(x);
	return s.size();
}

signed main() {
	int a, b;
	while (cin >> a >> b) {
		cout << DigitCount(a + b) << endl;
	}
	return 0;
}

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

int main(){
	int a, b, num, i = 0;
	cin >> a >> b;
	num = a*b;
	while(1){
		if(num < 10) break;
		i++;
		num /= 10;
	}
	cout << i << endl;
    return 0;
}

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

static const int DataMax = 200;	// Max value of elements

typedef struct _data_list
{
    int count;	// Number of elements
    std::vector<int> vec[DataMax];
} data_list_t;

static void InputData(data_list_t& data)
{
    int v1, v2;

    if (0x00 == &data) {
        std::cerr << "data is null" << std::endl;
        exit (1);
    }

    while (std::cin >> v1 >> v2) {
        data.vec[data.count].push_back(v1);
        data.vec[data.count].push_back(v2);
        data.count++;
    }
}

static int getDigitSumOfValues(data_list_t& data, int index)
{
    int digit = 0;
    int sum = 0;

    if (0x00 == &data) {
        std::cerr << "data is null" << std::endl;
        exit (1);
    }

    for (int i = 0; i < data.vec[index].size(); i++) {
            sum += data.vec[index].at(i);
    }

    while (sum >= 1) {
        digit++;
        sum /= 10;
    }

    return digit;
}

int main()
{
    data_list_t data = {0};

    InputData(data);
    for (int i = 0; i < data.count; i++) {
        std::cout << getDigitSumOfValues(data, i) << std::endl;
    }

    return 0;
}

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

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

C++: //#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
//#include <cstdio>
//#include <cstdlib>
//#include <cmath>
#include <iostream>
#include <algorithm>
//#include <cstring>
#include <vector>
#include <string>
#include <map>
#include <list>
#include <queue>
#include <set>
using namespace std;

int main(void){

	int a, b;
	
	while(cin >> a >> b){
	string num = std::to_string(a+b);
	
	cout << num.size() << endl;
	}

	return 0;
}

/*
for(i=0;i<N;i++){
	cin >> X[i];
}


for(i=0;i<N;i++){
	for(j=0;j<N;j++){
		cin >> X[i][j];
	}
}
*/

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

int main(){
	int nums[2];
	for(int i=0; i<2; ++i){
		scanf("%d", &nums[i]);
	}

	printf("%d\n", nums[0]+nums[1]);

	return 0;
}

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

int main() {
	int a, b;
	while (cin >> a >> b) {
		int sum = a + b;
		int i = 1;
		int count = 0;
		while (sum / i != 0) {
			count++;
			i *= 10;
		}
		cout << count;
	}
	return 0;
}

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

using namespace std;
int i,a,b;
string s;

int main() {
	while(cin>>a>>b){
		a = a+b;
		s = to_string(a);
		cout << s.size() << endl;
	}
	return 0;
}

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

using namespace std;

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

	return 0;
}

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

int main() {
	int a, b;
	int D[200] = { 0 };
	for (int i = 0; i < 5; ++i) {
		int digits = 1;
		cin >> a >> b;
		int n = a + b;
		n /= 10;
		while (n) {
			++digits;
			n /= 10;
		}
		D[i] = digits;
	}

	for (int i = 0; i < 200; ++i) {
		if (D[i] == 0) {
		}
		else {
			cout << D[i] << endl;
 		}
	}
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = {-2};

void input() {
	int i = 0;

	while (CI data_[i][0] >> data_[i][1]) {
		i++;
	}

	return;
}


int main(void) {
	input();
	int i = 0;
	int sum = 0;
	int numb = 0;

	while (true) {
		sum = data_[i][0] + data_[i][1];
		while (sum != 0) {
			numb++;
			sum /= 10;
		}
		if (data_[i + 1][0] == -2) {
			break;
		}
	}

	CO numb E

	return 0;
}

C++: #include <iostream>

using namespace std;

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

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

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

}

C++: #include <iostream>
#include <string>
#include <sstream>

using namespace std;

int main()
{
	int a, b;
	while (cin >> a){
		cin >> b;
		int sum = a + b;
		stringstream ss;
		ss << sum;
		string str(ss.str());
		cout << str.size() << endl;
	}
}

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

 int digit(int a)
 {
  int count=0;
  while (a)
  {
    a/=10 ;
    count++;
  }
  return count;
}

int main(){
  int x, y;
  while( cin >> x >> y && x != EOF)
        cout << digit(x+y) << endl;
}

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

int get_digit(int num);

template < typename T > std::string to_string(const T& n)
{
	std::ostringstream stm;
	stm << n;
	return stm.str();
}

int main() {
	int first;
	int second;
	int data_cnt = 0;
	std::vector<int> inputs;

	while ((cin >> first >> second) || (data_cnt < 200)) {
		data_cnt++;
		inputs.push_back(first + second);
	}

	for (int i = 0; i < data_cnt; i++) {
		cout << get_digit(inputs[i]) << endl;
	}

	return 0;
}

int get_digit(int num) {
	return std::to_string(num).length();
}

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

using namespace std;

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

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

using namespace std;

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

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

using namespace std;

int main(){
	double i,j;

	while(cin >> i >> j) {
		cout << floor(log10(i + j) + 1) << endl;
	} 
	return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	bool flg;
	int cnt=-1;
	
	while(cin>>a>>b){
		cnt++;flg=false;
		//-----test-----
		if(cnt==104) break;
		//--------------
		c=a+b;
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}