Parse a signed integer in any base, with overflow checks
Write a production-quality parser that turns a string into a 32-bit signed integer in a given base. Handle signs, digits and letters valid for the base, and report invalid syntax, an unsupported base and overflow as distinct outcomes. Explain how you detect overflow before it happens.
No answer yet. Write the first one; the best answer gets endorsed.
