Как ускроить выполнение!

import java.io.*;
import java.util.Scanner;
public class problem1196 { 
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int sum=0;
int value=0;
int[] A=new int [n];
boolean[] map =new boolean[n];
for(int i=0;i<n;i++){
A[i]=sc.nextInt();
}
int m=sc.nextInt();
int[] B=new int[m];
for (int i=0;i<m;i++){
B[i]=sc.nextInt();
}
for (int i=0;i<m;i++){
value=B[i]; 
 
if (BinarySearch(A,0,n-1,value)!=0)
sum++;
}
System.out.println(sum);
}
public static long BinarySearch(int[] Mas,int left,int right,int value){
int half;   
while(left<=right){
half=(left+right)/2;
if (value==Mas[half]) return Mas[half];
else if (value<Mas[half]) right=half-1;
else left=half+1;
}   
return 0;
}}

boolean []b = new boolean[1000000];
for(int i = 0; i < n; i++)
  b[in.nextInt()] = true;
...
for(int i = 0; i < m; i++)
  if(b[in.nextInt()])
    ans++;

import java.io.*;
public class problem1196 { 
static int nextInt(BufferedReader reader) throws IOException {
return Integer.parseInt(reader.readLine());
}
public static void main(String[] args)throws IOException {
BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
int n=nextInt(inp);
int sum=0;
int value=0;
int[] A=new int [n];
for(int i=0;i<n;i++){
A[i]=nextInt(inp);
}
int m=nextInt(inp);
int[] B=new int[m];
for (int i=0;i<m;i++){
B[i]=nextInt(inp);
}
for (int i=0;i<m;i++){
value=B[i]; 
if (BinarySearch(A,0,n-1,value)!=0)
sum++;
}
System.out.println(sum);
}
public static long BinarySearch(int[] Mas,int left,int right,int value){
int half;   
while(left<=right){
half=(left+right)/2;
if (value==Mas[half]) return Mas[half];
else if (value<Mas[half]) right=half-1;
else left=half+1;
}   
return 0;
}}

import java.io.*;
public class prob1196 {
static int nextInt(BufferedReader reader) throws IOException {
return Integer.parseInt(reader.readLine());
}
public static void main(String[] args)throws IOException {
BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
boolean []b = new boolean[1000000];
int n=nextInt(inp);
int ans=0;
for(int i = 0; i < n; i++)
b[nextInt(inp)] = true;
int m=nextInt(inp); 
for(int i = 0; i < m; i++)
if(b[nextInt(inp)])
ans++;
System.out.println(ans);
}
}