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>
#include <string>
using namespace std;

string sum(string s, string t){
    reverse(s.begin(), s.end());
    reverse(t.begin(), t.end());
    
    string res;
    int carry = 0;
    int md = max(t.size(), s.size());
    for(int i=0; i<=md; i++){
        int sc = i<s.size()? s[i]-'0': 0;
        int tc = i<t.size()? t[i]-'0': 0;
        int d = sc + tc + carry;
        char nd = '0' + (d%10);
        if(i == md && nd == '0')
            continue;
        res += nd;
        carry = d/10;
    }
    reverse(res.begin(), res.end());
    return res;
}

int main(){
    string s, t;
    while(cin >> s >> t){
        cout << sum(s, t).size() << endl;
    }
    return 0;
}

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

int main(void){
  int c = 0, i, j, a, b, d;
  char tmp[8]; // 0 - 1000000
  for(j = 0; c != EOF && j <= 200; j++){
    if( j != 0){
      printf("\n");
    }
    i= 0;
    while((c = getchar()) != EOF && c != '\n'){
      tmp[i++] = c;
      if(c == ' '){
        tmp[i] = '\0';
        a = atoi(tmp);
        i = 0;
      }
    }
    tmp[i] = '\0';
    b = atoi(tmp);

    d = a + b;
    for(i = 0; d != 0; i++){
      d /= 10;
    }
    printf("%d", i);
  }
  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");
  */
  system("more out2.txt");

return 0;
}

C++: #include<iostream>
#define element 2

using namespace std;

int a[element], b[element], n[element], m[element];

int main()
{
	for(int i=0;i<=element;++i)
	{
		cin >> a[i] >> b[i];
		n[i] = a[i] + b[i];
	}
	for(int i=0;i<=element;++i)
	{
		m[i] = 1;
		while(n[i]>=10)
		{
			n[i]=n[i]/10;
			++m[i];
		}
		printf ("%d\n",m[i]);
	}
	return 0;
}

C++: #include <stdio.h>

int main(void)
{
	unsigned int a[2];
	int i;
	int count;

	for(i = 0; i < 2; i++){
		scanf("%d", &a[i]);
	}
	i = a[0] + a[1];
	count = 0;
	do{
		count++;
	}while((i = i/10) > 0);

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

C++: int main()
{
	int a, b,sum,n;
	n = 0;


	while (cin >> a >> b)
	{
		sum = a + b;

		for (;;)
		{
			sum = sum / 10;
			n = n + 1;

			if (sum == 0)
			{
				break;
			}
		}

		cout << n << endl;
	}

  return 0;
}

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

using namespace std;

int main()
{
	int a, b;

	while (cin >> a >> b)
	{
		cout << log10(a + b) + 1 << endl;
	}

	return 0;
}

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 (scanf_s("%d%d",&data_[i][0],&data_[i][1]) != EOF) {
		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(void){
  long a, b, sum, count;
  
  while(true) {
    cin >> a >> b;
    
    count = 0;
    sum = a + b;
      while(sum != 0) {
        sum /= 10;
        count++;
      }
    cout << count << endl;
    
    if ( cin.eof() ) { break; }
  }
}

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

int main(){
	int sum,j;
	int i=0;
	int N;
	
	cout << "How many date sets (N<=200) N=";
	cin >> N;
	int a[N], b[N], dig[N];
	
	while(i<N){
		cout << "please input `a b' : ";
		cin >> a[i] >> b[i];
		dig[i]=1;
		if(0<=a[i] && a[i]<=1000000 && 0<=b[i] && b[i]<=1000000){
			sum = a[i]+b[i];
			while(sum/10 != 0){
				sum = sum/10;
				dig[i] += 1;
			}
			i++;
		}
		else{
			cout << "error!\n";
		}
	}
	
	for(j=0; j<i; j++){
		cout << dig[j] << "\n";
	}
}

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

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

int get_digit(int num);

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) {
	unsigned digit = 0;
	while (num != 0) {
		num /= 10;
		digit++;
	}
	return digit;
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="77675555";
	
	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;
}