Python match-case vs dictionary performance internals

When conditional branching logic grows large in Python, the advice has always been to map keys to functions or values using a dictionary lookup mapping.get(key) to achieve O(1) time complexity, rather than using a long, O(n) sequence of if-elif statements.

However, with structural pattern matching (match-case) in Python 3.10+, the syntax looks pretty clean for these types of large branch choices:

match status_code:
    case 200: return "OK"
    case 404: return "Not Found"
    case 500: return "Internal Server Error"
    # ... dozens of cases

Does the compiler optimize a match-case block with literal values into a jump table or an internal hash map lookup, or does it evaluate sequentially like a traditional if-elif loop?

Does match-case create any transient runtime overhead compared to keeping a persistent dictionary configuration in memory?