Please in order to save solutions and appear on the leaderboards.

Details

A vampire number is a non-negative number that can be factored into two numbers (fangs) each with half as many digits as the original where the two factors contain all the digits of the original, in any order. Both fangs may not have trailing zeros.

For example 1260 = 21*60, 1395 = 15*93, 1435 = 35*41, 1530 = 30*51, etc..

Print all the vampire numbers from 1 to 1,000,000 inclusive, each on their own line.

Be careful with the algorithmic complexity of your solution to avoid timing out.

0 characters
 
 
 
 
 
 
 
 
ARGV is available via STDIN, joined on NULL. x is a no-op.
arguments holds ARGV, print() to output with a newline, write() to output without a newline.
say() is available without any import.
SELECT arg FROM argv to access the arguments, only the first column of the first result set will be printed, NULL values will be skipped, and the dialect is SQLite.
ctrl + enter or Run