No Branch 2 

for (auto i = 0u; i < arr.size(); ++i) {
  if (arr[i] > 128)
    sum += arr[i];
}
^ This is Faster?
int sum[2] = {0, 0};
for (auto i = 0u; i < arr.size(); ++i) {
  sum[arr[i] > 128] += arr[i];
}
// The answer is in sum[true]
^ This is Faster?

* The benchmark is run under AMD Ryzen 9.

* For the full benchmark code, please refer here.

* For illustration purposes only, see FAQ for more details.