+1 but sometimes it's not enough

Another possible way is to implement your own reader for integer/real/signed types using getchar():

int next_int() {
  char c;
  do { c = getchar(); } while( c != '-' && !isdigit(c) );
  bool neg = (c == '-');
  int result = neg ? 0 : c - '0';
  while( isdigit(c = getchar()) )
    result = 10 * result + (c - '0');
  return neg ? -result : result;
}

In most cases coders use it to get top1 by execution time))

But in case N = 10^6 it may be useful to beat TL with solution that wasn't intended by jury.