Go: package main

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

var (
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	for sc.Scan() {
		chunks := strings.Split(sc.Text(), " ")
		if len(chunks) != 2 {
			break
		}
		a, _ := strconv.Atoi(chunks[0])
		b, _ := strconv.Atoi(chunks[1])
		fmt.Println(a + b)
	}
}

C++: 
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>


using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x*x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#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 EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
#define loop(n) FOR(i,0,n)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

int dig(int n) {
	
	int ans = 0;
	while(n > 0) {
		ans++;
		n /= 10;
	}

	return ans;
}

int main() {

	int a, b;

	while (cin>>a>>b) {

		int n = a + b;

		cout << dig(n) << endl;
	}
	return 0;
}

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

int main(){
  long a, b, c;
  int i = 10;
  int num = 1;
  
  while(scanf("%d", &a)!=EOF){
    scanf("%d", &b);
    c = a + b;
    while(1){
      if(c/i!=0){
        num++;
        i *= 10;
      }else{
        break;
      }
    }
    std::cout << num << std::endl;
  }
  
  return 0;
  
}

C++: #include "iostream"
#include "string"
#include "cmath"
using namespace std;

int main(int argc, char const *argv[])
{
  int a, b, total;
  cin >> a >> b;
  total = a+b;
  total = floor(log10(abs(total))) + 1;
  if (total < 0)cout << 0;
  else cout << total;
  return 0;
}

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

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#define REP(i,n) for(long long int (i)=0;(i)<(n);i++)


using namespace std;


int main(){
  int a,b;
  while(cin >> a >> b){
    cout << a+b;
  }
}

C++: #include<string>
#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int a,b;
	cin >> a>>b;
 string x=IntToString(a+B);
cout<<x.size()<<endl;
return 0;
}
string IntToString(int number)
{
  string stream ss;
  ss << number;
  return ss.str();
}

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

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

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

int main(){
	int a, b, sum;

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

		for(int i=1; ; ++i){
			if(sum<10){
				cout << i << endl;
				break;
			}else{
				sum /= 10;
			}
		}
	}

	return 0;
}

C++: #include<cstdio>
int main(){for(int a,b;~scanf("%d%d",&a,&b);printf("%d\n",sprintf(char* &a,"%d",a+b)));}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
    int a,b;
    int k=1;
    int m=10;
    while(cin>>a>>b){
        while(a+b>=m/*pow(10,k)*/){
            k++;
            m*=10;
        }
        cout<<k<<endl;
    }
    return(0);
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑


int digits(int n) {
	int ans = 0;
	while (n) {
		++ans;
		n /= 10;
	}
	return ans;
}

int main() {
	int a, b;
	while (cin >> a && cin >> b) {
		cout << digits(a + b) << endl;
	}
}

C++: #include <stdio.h>

int main(){
 int a,b;
 while(scanf("%d %d ",&a,&b)){
  a+=b;
  b=0;
  while(a>0){
  b++;
  a/=10
  }
  printf("%d\n",b?b:1);
 }



 return 0;
}

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

int main(){
	int a, b, c, n=0, i=0, ans[1000];
	while(cin>>a>>b){
		c=a+b;
		while(c!=0){
			c/=10;
			n++;
		}
		ans[i]=n;
		n=0;
		i++;
	}
	int j=0;
	while(j<i){
		cout<<ans[j]<<endl;
		j++;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;
int main()
{
	int a, b;
	while (cin>>a>>b)
	{
		char s[7];
		sprintf(s, "%d", a + b);
		cout << strlen(s) << endl;
	}


	return 0;
}

C++: /*Filename: aoj0002.cpp
 *Author: Mushiyo
 */

#include <iostream>
#include <cmath>

using namespace std;

int countDigit(int num){
	if(num == 0){
		return 1;
	}

	int digit = (int)log10(num) + 1;

	return digit;
}

int main(){
	int a = 0, b = 0;

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

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

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

C++: #include <iostream>

int main(){

  int a[200];
  int b[200];

  int i=0,A,B;

  while(std::cin >> A >> B){
    a[i] = A;
    b[i] = B;
    ++i;
  }
  int k;

  for(int j=0;j<i;j++){
    a[j] += b[j];
    k=0;
    do{
      a[j] /= 10;
      ++k;
    }while(a[j]<10);

    std::cout << k << std::endl;
  }
}

C++: #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
 int a, b, c, count = 0;
 while(cin >> a >> b){
 c = a + b;
 while(c != 0){
  c = c / 10;
  count++;
 }
 cout << count << endl;
 count = 0;
}

 return 0; 
}

C++: using System;
using System.Linq;
 
public class Program
{
    private static void Main(string[] args)
    {
        string line;
        while (!string.IsNullOrEmpty(line = Console.ReadLine()))
        {
            Console.WriteLine(line.Split().Select(int.Parse).Sum().ToString().Length);
        }
    }
}