Go: package main

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

func main() {
	var total int
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		line := scanner.Text()
		strs := strings.Split(line, " ")

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

	fmt.Printf("%v\n", total)
}

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

#define rep(i,n) for(long long i=0;i<n;i++)
#define REP(i,s,n) for(long long i=(s);i<=(n);i++)
#define repr(i,n) for(long long i=n-1;i>=0;i--)
#define REPR(i,s,n) for(long long i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(unique(all(v)),v.end())
#define Eback(s) s.erase(s.end()-1,s.end())
#define minvec(v) *min_element(all(v))
#define maxvec(v) *max_element(all(v))
#define sumvec(v) accumulate(all(v),0LL)
#define pb push_back
#define pf push_front
#define m_p make_pair
#define DOUBLE fixed << setprecision(15)
#define OK cerr<<"OK\n"
#define OK1 cerr<<"OK1\n"
#define OK2 cerr<<"OK2\n"
#define sz(s) (long long)s.size()
#define INF ((1LL<<62)-(1LL<<31))
#define zero(x,n) setw(x) << setfill('0') << n
//#define endl '\n'

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vd> vvd;
typedef vector<vc> vvc;
typedef vector<vb> vvb;
typedef pair<ll,ll> P;
typedef vector<P> vP;

template<class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>&p) {
	ost << "{" << p.first << ", " << p.second << "} ";
	return ost;
}

template<class T>
ostream& operator<<(ostream& ost, const vector<T>&v) {
	ost << "{";
	for (int i = 0; i<(int)v.size(); i++) {
		if (i)ost << " ";
		ost << v[i];
	}
	ost << "} \n";
	return ost;
}

template<class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>&v) {
	ost << "{";
	for (auto p:v) {
		ost << "{" << p.first << ", " << p.second << "} ";
	}
	ost << "} ";
	return ost;
}

void out(){cout << "\n";}
template<class T,class... Args>
void out(const T &x,const Args &... args){
	cout << x << " ";
	out(args...);
}

template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
	for(T& e: vec) is >> e;
	return is;
}

template<typename T>
string join(vector<T>& vec, string sep=" "){
	stringstream ss;
	for(int i=0;i<(int)vec.size();i++){
		ss << vec[i] << (i+1==(int)vec.size()?"\n":sep);
	}
	return ss.str();
}

template<class T>
inline bool chmax(T& a, T b){if(a<b){a=b;return true;} return false;}

template<class T>
inline bool chmin(T& a, T b){if(a>b){a=b;return true;} return false;}

#define INT(...) int __VA_ARGS__;IN(__VA_ARGS__)
#define LL(...) long long __VA_ARGS__;IN(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;IN(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;IN(__VA_ARGS__)
#define LD(...) long double __VA_ARGS__;IN(__VA_ARGS__)

void scan(int& a){ cin >> a; }
void scan(long long& a){ cin >> a; }
void scan(char& a){ cin >> a; }
void scan(double& a){ cin >> a; }
void scan(string& a){ cin >> a; }
void scan(long double& a){ cin >> a; }

void IN(){}
template<class Head,class... Tail> void IN(Head& head,Tail&... tail){ scan(head); IN(tail...); }

void YES(bool b) {cout << ((b)?"YES\n":"NO\n");}
void Yes(bool b) {cout << ((b)?"Yes\n":"No\n");}
void yes(bool b) {cout << ((b)?"yes\n":"no\n");}
void Yay(bool b) {cout << ((b)?"Yay!\n":":(\n");}

const long double pi = acos(-1.0);
const ll mod=1000000007;
//const ll mod=998244353;

ll powmod(ll a,ll b){ll c=1; while(b>0){ if(b&1){ c=a*c%mod; } a=a*a%mod; b>>=1; } return c;}
ll nCrmod(ll n,ll r){ll x=1,y=1; for(ll i=0;i<r;i++) {x=x*(n-i)%mod; y=y*(i+1)%mod; } return x*powmod(y,mod-2)%mod;}
ll gcd(ll a,ll b){ while(b){ ll c=b; b=a%b; a=c; } return a; }
ll lcm(ll a,ll b){ if(!a || !b) return 0; return a*b/gcd(a,b); }
vll divisor(ll x){ vll v; for(int i=1;i*i<=x;i++)if(x%i==0){ v.pb(i);if(i*i!=x)v.pb(x/i); } sort(all(v)); return v; };
map<ll,ll> prime_factor(ll n){ map<ll,ll> m; for(ll i=2;i*i<=n;i++){ while(n%i==0){ m[i]++; n/=i; } } if(n!=1) m[n]=1; return m; }

int main()
{
    LL(a,b,c,d);
    cout << a + b + c + d << endl;
	return 0;
}

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

int main() {
    int A,B,C,D;
    cin>>A>>B>>C>>D;
    cout<<A+B+C+D<<endl;
}

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

int main(){
    int a,b,c,d; cin >>a>>b>>c>>d;
    cout << a+b+c+d << endl;
}

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


  
int main(){
  

  int R, B, W, G;
  cin >> R >> B >> W >> G;
  cout  << R+B+W+G << "\n";
 return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int sum=0;
  for(int i=0;i<4;i++){
    int a;
    cin>>a;
    sum+=a;
  }
  cout<<sum<<'\n';
}

C++: #include <iostream>
using namespace std;
int main(){

int R,B,W,G,M;

cin >>R>>B>>W>>G;

  M=R+B+W+G;

cout<<M<<endl;



return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int ans = 0;
    for (int i = 0; i < 4; i++)
    {
        int num;
        cin >> num;
        ans += num;
    }
    cout << ans << "\n";
}

C++: /*イヅア公園には、夕方になると柴犬と散歩する人たちがたくさん来ます。
   柴犬には毛の色によって赤柴、黒柴、白柴、胡麻柴という種類があります。
   柴犬がたくさんいるとうれしいトモエちゃんは、
   それぞれの毛色の柴犬が何頭いるかがんばって数えましたが、
   まだ足し算ができないので柴犬が全部で何頭いるかわかりません。
   それぞれの毛色の柴犬の数が与えられたときに、
   柴犬の総数を計算するプログラムを作成せよ。*/

#include <iostream>
using namespace std;

int main(int argc, char const *argv[]) {
        int R, /*赤柴の数*/
            B, /*黒柴の数*/
            W, /*白柴の数*/
            G, /*胡麻柴の数*/
            sum; /*柴犬の総数*/
        cin >> R >> B >> W >> G;
        sum = R + B + W + G;
        cout << sum <<endl;
        return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){

int R,B,W,G;

cin >>R>>B>>W>>G;

cout<<R+B+W+G<<endl;
    
}

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

int main(){
    int r,b,w,g;
    cin>>r>>b>>w>>g;
    cout<<r+b+w+g<<endl;
    return(0);
}

C++: #include<iostream>
using namespace std;
int main() {
	int a, b, c, d;
	cin >> a >> b >> c >> d;
	cout << a + b + c + d<<"\n";
}

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

int main(){

	int n;
	int num=0;
	for(int i=0; i<4; ++i){
		cin >> n;
		num += n;
	}

	cout << num << endl;
	return 0;

}

C++: #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int R, B, W, G;
    cin >> R >> B >> W >> G;
    cout << R + B + W + G << endl;
    return 0;
}