Given a string s consisting of digits, find all unique prime numbers that can be formed by converting any contiguous substring of s into an integer.

Return the sum of the $3$ largest unique prime numbers obtained. If fewer than $3$ unique prime numbers exist, return the sum of all available unique prime numbers. If no prime numbers can be formed, return $0$.

Constraints:

• $1 \leq$ s.length $\leq 10$

• s consists of only digits.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.