INTEST  Enormous Input Test
The purpose of this problem is to verify whether the method you are using to read input data is sufficiently fast to handle problems branded with the enormous Input/Output warning. You are expected to be able to process at least 2.5MB of input data per second at runtime.
Input
The input begins with two positive integers n k (n, k<=10^{7}). The next n lines of input contain one positive integer t_{i}, not greater than 10^{9}, each.
Output
Write a single integer to output, denoting how many integers t_{i} are divisible by k.
Example
Input: 7 3 1 51 966369 7 9 999996 11 Output: 4
hide comments
Bryan Poulsen:
20160226 22:56:10
Fastest I could get with PyPy was 0.93 seconds  tried every variation of standard in that I could think of. 

Bryan Poulsen:
20160226 22:24:07
Submitted in python 2.7.10 got TLE, resubmitted same solution in Pypy got AC in 1.02 seconds. 

entcat:
20160222 19:19:53
used simple brute force logic in python , submitted in python 2.7.10 got TLE, resubmitted in pypy got accepted . could anyone provide me a reason why that occured 

狂徒归来:
20151106 14:22:58
2.9s in RUST 

Andres Mauricio Rondon Patiño:
20151011 20:52:58
Scanf/Printf AC in 0.5s


gautams:
20150818 19:06:32
Is there any other tricks other than getchar_unlocked in c?? 

Abhinandan Agarwal:
20150727 08:22:35
0.11s with getchar_unlocked and .56 with scanf . stream input output functions take time around 5s here. 

karthik1997:
20150708 10:50:43
0.11 sec ac :D


Sue:
20150628 15:01:55
0.63s with pas :)))) 

sqd:
20150613 05:58:03
Did anyone pass this using Haskell? 
Added by:  adrian 
Date:  20041109 
Time limit:  2.112s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:  Idea put forward by Michael Mendelsohn 