C, binary data, and coding problem

You are given a binary file containing unsorted unsigned 32-bit integers. The file contains up to 2^20 random, unique integers, encoded in big-endian format. Each integer will be in the range [0, 2^25). Write a program that, given an integer in range [0, 2^25), will return the closest integer from the input file. If there is a tie for the closest, return the lower one. Your program should take one command-line argument: ./query <path_to_input_file> Your program should read test cases from standard input and write results to standard output, one per line.