My code

… was written in C++11 and can be compiled with G++, Clang++, Visual C++. You can download it, too. Or just jump to my GitHub repository.

       
#include <iostream>
       
#include <vector>
       
#include <algorithm>
       
 
       
int main()
       
{
       
  // search limit
       
  auto limit = 1000000000000ULL;
       
  std::cin >> limit;
       
 
       
  // 1 is a strong unit in all bases
       
  std::vector<unsigned long long> found = { 1 };
       
 
       
  // analyze other bases
       
  for (unsigned long long base = 2; base*base < limit; base++)
       
  {
       
    auto current = 1 + base + base * base;
       
    auto powers = base * base;
       
    while (current < limit)
       
    {
       
      found.push_back(current);
       
      powers  *= base;
       
      current += powers;
       
    }
       
  }
       
 
       
  // remove duplicates
       
  std::sort(found.begin(), found.end());
       
  auto last = std::unique(found.begin(), found.end());
       
  found.erase(last, found.end());
       
 
       
  // display sum of all elements
       
  unsigned long long sum = 0;
       
  for (auto x : found)
       
    sum += x;
       
  std::cout << sum << std::endl;
       
  return 0;
       
}

This solution contains 5 empty lines, 5 comments and 3 preprocessor commands.