To count the sum of all Unicode characters of a given input under an interesting constraint Program: To count the sum of all Unicode characters of a given input.
(No need to display the output. The final answer can be calculated in any base no need to convert back to hexadecimal.)
Test case : XyZ= 0058+0079+005A=012B
Condition: If the program is inputted, then its output must be an integral multiple of 1729 (hex 06C1). (Sum of all characters (Unicode) in the code must be equal to an integral multiple of 1729.)
Winning criterion: code golf.

Sandbox
Haskell, 20 18 bytes
Sheer luck!

sum.fmap(fromEnum)

Try it online!