Solution to Subset Sum Problem

What is subset sum problem?
Subset Sum Problem is this: given a set of integers, does there exist a subset of those integers whose sum is zero? It is a famous NP-complete problem.

How is my solution?
My solution is optimized for huge inputs. It can solve the inputs that containing almost unlimited random numbers in seconds. Specifically, it requires that arbitrary subset sums of the input are in range (-2^31,2^31 ), and the input is randomized enough so that the solutions are not too sparse.