for E of x loop
S := S + E;
end loop;
int i,s;
for(i=s=0;i<n;i++)
{
s+=x[i];
}
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += x[i];
}
(defn sum [x] (reduce + x))
(sum [1 20 300])
;;=> 321
auto s = std::ranges::fold_left(x, 0, std::plus<int>{});
int s = std::accumulate(x.begin(), x.end(), 0, std::plus<int>());
var s = x.fold(0, (a, b) => a + b);
s := 0
for _, v := range x {
s += v
}
var s = x.reduce((a, b) => a + b, 0);
var s = x.reduce((a, b) => a + b)
int s = 0;
for (int i : x) {
s += i;
}
BigInteger s = new BigInteger(valueOf(x[0]));
for (int i = 1, n = x.length; i < n; ++i)
s = s.add(new BigInteger(valueOf(x[i])));
BigInteger s
= Arrays.stream(x)
.mapToObj(String::valueOf)
.map(BigInteger::new)
.reduce(BigInteger::add)
.get();
int i = 0, n = x.length, s = x[i];
while (++i < n) s = s + x[i];
int s = IntStream.of(x).sum();
val numbers = listOf(1, 2, 3, 4)
val sum = numbers.sum()
s = 0
for i,v in ipairs(x) do
s = s + v
end
id s=[x valueForKeyPath:@"@sum.self"];
var
_x: Array of integer;
_s, i: Integer;
begin
_s := 0;
//assume _x contains some values
for i := Low(_x) to High(_x) do _s := _s + _x[i];
end;
let s = x.iter().sum::<i32>();
(define s (fold-right + 0 x))
Dim s As Integer = x.Sum()