/prog/ challenge V̅MCLXXIV: Dr. Kaprekar

Write the function KaprekarsConstant(num). num parameter being passed will be a 4-digit number with at least two distinct digits. Your program should perform the following routine on the number: Arrange the digits in descending order and, separately, in ascending order (adding leading zeroes to fit it to a 4-digit number), and subtract the smaller of the two resulting numbers from the bigger number. Repeat. Performing this routine will always cause you to reach a fixed number: 6174. Then performing the routine on 6174 will always give you 6174 (7641 - 1467 = 6174). Your program should return the number of times this routine must be performed until 6174 is reached.

｡゜*:｡:｡☆ﾟ･.+♩*:***＊｡:　＊.｡.ﾟ　　　･・❀o❀･ﾟ｡✧ﾟ･　:　。*　　;:.* ゜+.｡○｡　♩;ﾟﾟ　｡

For example: if num is 3524 your program should return 3 because of the following steps:
⁽¹⁾ 5432 - 2345 = 3087,
⁽²) 8730 - 0378 = 8352,
⁽³⁾ 8532 - 2358 = 6174.

Shortest byte count wins. Good luck!

>>3
So I create an interpreter that has built-in support for solving this challenge, and perhaps a zero-byte source is interpreted to mean solve the challenge exactly, I would win?