Jakkara

#include <iostream>
#include <cmath>

#define ll long long
#define ull unsigned long long

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;

ll a, b, c, d;

ll f(ll e){
	return abs(e-a)+abs(e-b)+abs(e-c)+abs(e-d);
}
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	cin >> a >> b >> c >> d;
	ll l = 0, r = 1LL<<33;
	while(l < r){
		ll mid = (l+r)/2;
		if(f(mid)<f(mid+1))
			r = mid;
		else
			l = mid+1;
	}
	//cout << "paras " << (l+r)/2 << endl;
	cout << f((l+r)/2) << endl;
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED