# 
# Solution to Project Euler problem 32
# Copyright (c) Project Nayuki. All rights reserved.
# 
# https://www.nayuki.io/page/project-euler-solutions
# https://github.com/nayuki/Project-Euler-solutions
# 

import eulerlib


def compute():
	# For contradiction suppose a candidate (x, y, z) has z >= 10000.
	# Then x*y consumes at least 5 digits. With the 4 (or fewer) remaining digits, even the
	# upper bound of x=99 and y=99 produces a product of x*y < 10000, which is unequal to z.
	# Therefore we need the product z < 10000 to be able to find possible x and y values.
	ans = sum(i for i in range(1, 10000) if has_pandigital_product(i))
	return str(ans)


def has_pandigital_product(n):
	# Find and examine all factors of n
	for i in range(1, eulerlib.sqrt(n) + 1):
		if n % i == 0:
			temp = str(n) + str(i) + str(n // i)
			if "".join(sorted(temp)) == "123456789":
				return True
	return False


if __name__ == "__main__":
	print(compute())