docs: public static int stringSize(int x) {
      if(x < 0) {
        // Avoid overflow on extreme negative
        return (x == Integer.MIN_VALUE) ? 11 : stringSize(-x) + 1;
      }
      // This is almost a binary search - 10 cases is not a power of two, and we
      // assume that the smaller values are more frequent.
      return //
      (x < 10000) // 1-4 vs. 5-10
          ? (x < 100) // 1-2 vs. 3-4
              ? ((x < 10) ? 1 : 2) //
              : ((x < 1000) ? 3 : 4) //
          : (x < 1000000) // 5-6 vs. 7-10
              ? ((x < 100000) ? 5 : 6) // 5-6
              : (x < 100000000) // 7-8 vs. 9-10
                  ? ((x < 10000000) ? 7 : 8) // 7-8
                  : ((x < 1000000000) ? 9 : 10); // 9-10
    }