Enormous Input Test CodeChef Solution

Problem – Enormous Input Test CodeChef Solution

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.


The input begins with two positive integers n k (n, k<=107). The next n lines of input contain one positive integer ti, not greater than 109, each.


Write a single integer to output, denoting how many integers ti are divisible by k.

Sample 1:



7 3


The integers divisible by 3 are 51,966369,9, and 999996. Thus, there are 4 integers in total.

Enormous Input Test CodeChef Solution in C++17

#include <bits/stdc++.h>
using namespace std;

int main()
    int n,k;
    cin >> n >> k;

    int count=0;
    for (int i=0;i<=n-1;i++)
        int a;
        cin >> a;
        if (a%k==0)

    cout << count << endl;
    return 0;

Enormous Input Test CodeChef Solution in Java

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

// Remember that the class name should be "Main" and should be "public".
public class Main {
	public static void main(String[] args) {
		// System.in and System.out are input and output streams, respectively.
		InputStream inputStream = System.in;

		InputReader in = new InputReader(inputStream);

		int n = in.nextInt();
		int k = in.nextInt();
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int x = in.nextInt();
			if (x % k == 0) {


	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
				    tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
				    throw new RuntimeException(e);
			return tokenizer.nextToken();

		public int nextInt() {
			return Integer.parseInt(next());

Enormous Input Test CodeChef Solution in Pyth 3

(n, k) = map(int, input().split(' '))

ans = 0

for i in range(n):
	x = int(input())
	if x % k == 0:
		ans += 1


Enormous Input Test CodeChef Solution Review:

In our experience, we suggest you solve this Enormous Input Test CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Enormous Input Test CodeChef Solution

Find on CodeChef


I hope this Enormous Input Test CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions

Leave a Reply

Your email address will not be published.