Abstract: In order to process those integers beyond the scope of computer wordlength, we need to construct suitable data structures for storing big data. This paper studies the characteristics of Narcissus numbers; combines the theory of permutation and combination with functional monotonicity; uses stack which has LIFO character; stores large integer by dynamic array. This method breaks through the traditional design which only considers processing finite length integers, makes the calculation work of finding Narcissus numbers reduce exponentially in the range of positive integers, achieves the purpose of finding all Narcissus numbers quickly in a short period of time within the set of positive integers. This method is a good reference for the processing of large integer.

Key words: Narcissus number, stack, memory, dynamic array, wordlength