Another ABAP puzzle – Narcissistic numbers

Here goes my solution: 

types TT_NUMBER type sorted table of I with unique key TABLE_LINE.
data(ARMSTRONG_NUMBERS)                                                      
  = value TT_NUMBER(                                                         
            for N = 0 while N < 100000                                   
            for M = 1                                                        
              while M = 1                                                    
                    and N = reduce I(                                        
                              let STR = |{ N }|                              
                                  LEN = STRLEN( STR ) in                     
                              init SUM = 0                                     
                              for OFF = 0 while OFF < LEN                    
                              next SUM += IPOW( BASE = STR+OFF(1) EXP = LEN ) )
            ( N ) ).

Few points about the solution:

• The solution uses string operations to find out the digits of the number. Similar to your solution 2
• The first iteration (for N) just generates the number sequentially
• The second iteration (for M) runs once and evaluates the sum of the powers of the digits of N

PS - I cannot create a pull request for the repo. Am i doing something wrong?