Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	for sc.Scan() {

		str := sc.Text()

		if str == "END OF INPUT" {
			break
		}

		strs := strings.Split(sc.Text(), " ")

		for _, s := range strs {
			fmt.Print(len(s))
		}

		fmt.Println()
	}

}

C++: #include <iostream>

using namespace std;

int main(){
    string a;
    while (getline(cin,a)&&a!="END OF INPUT"){
        int num=0;
        for(int i=0;i<a.length();++i){
            if(*a[i]==" ") {
                cout << num;
                num=0;
            }else num++;
        }
        cout << endl;
    }
}

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

int main(){
	std::string s;
	while (std::getline(std::cin,s)){
		if (s == "END OF INPUT")break;
		std::string ans;
		int a = 0;
		for (int i = 0; i < s.size(); ++i){
			if (s[i] != ' ')a++;
			else{
				char c = a + '0';
				ans+=c;
				a = 0;
			}
			if (i == s.size() - 1){
				char c = a + '0';
				ans += c;
			}
		}
		std::cout << ans << std::endl;
	}
	return 0;
}

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

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  string s;
  while(getline(cin, s)){
  	if(s == "END OF INPUT")break;
  	int curr = 0;
  	s += " ";
  	rep(i, sz(s)){
  		if(s[i] == ' '){
  			cout << curr;
  			curr = 0;
  		}else curr++;
  	}
  	cout << endl;
  }
  return 0;
}

C++: #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int main(){
    string s;
    while(getline(cin,s)){
        if(s=="END OF INPUT")break;
        int last=0;
        vi v;
        for(int i=0;i<s.size();i++){
            if(s[i]==' '){
                v.push_back(i-last);
                last=i+1;
            }
        }
        v.push_back((int)s.size()-last);
        rep(i,v.size())if(i)cout<<v[i];else cout<<v[i];
        cout<<endl;
    }
}

C++: #include<iostream>
using namespace std;
int main(void){
	char w[100],end[12]={"END OF INPUT"};
	int i;
	int cnt;

	while(1){
	cnt=0;
	cin.getline(w,sizeof(w));
		for(i=0;i<12;i++){
			if(w[i]!=end[i])
				break;
			else
				return 0;
		}
		for(i=0;w[i]!='\0';i++){
			if(w[i]==' '){
				cout<<cnt;
				cnt=0;
				if(w[i+1]==' '){
					cout<<cnt;
					i+=2;
				}
				continue;
			}
			cnt++;
		}
		cout<<cnt<<endl;
	}
}

C++: #include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int main(){
	string s;
	while(getline(cin,s)){
		if(s=="END OF INPUT")break;
		int count=0;
		for(int i=0;i<s.size();i++){
			count++;
			if(s[i]==' '){
				printf("%d",count-1);
				count=0;
			}
		}
		cout<<count<<endl;
	}
	return 0;
}

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

int main(void)
{
  string line;
  while (true)
  {
    getline(cin, line);
    if ( line == "END OF INPUT" ) break;

    int count = 0;
    for (int i = 0, size = line.size(); i < size; i++)
    {
      if (line[i] != ' ')
      {
        count++;
      }
      else
      {
        cout << count;
        count = 0;
      }
    }
    cout << count << endl;
  }
}