Python 104

[murilocamargos]

How the solution works

This is a brute force solution with two optimizations:

1. Getting first and last 9 digits without transforming it to string so we don't need to convert the entire number (it's big);
2. Checking if the number is divisible by three, all 1-9 pandigital numbers are divisible by three.

Performance

Python 3

Real time: 24.138 s
User time: 23.978 s
Sys. time: 0.015 s
CPU share: 99.40 %
Exit code: 0

[lucaspbordignon]

🔝

[lucaspbordignon]

Cannot simply pass as a set to pand2? Like pand2(set(x)) and there we do the same thing, but without a string comparison.

What do you think? (:

[FrankKair]

Hey, @murilocamargos.
Thank you for this contribution. This is a hard one!

Can you just check the CONTRIBUTING file to meet the standards for Python?

We're trying to keep a pattern for better comparison between languages :)