Hey so I have written a program that makes use of parallel programming to crack hashes. The first thing the program does is read data from a txt file (This is the word list for the program to use to compare hashes) and splits it up into smaller chunks (appends x number of lines to a vector then adds that vector to another vector of vectors and repeats this until all lines have been read). Now this takes a long time to do when using large word lists obviously, so I was wondering if there would be any way I could possibly make this process a lot faster may it be making use of parallel programming or any other techniques.
Current code being used:
std::ifstream file(fileName);
// Filling vector with lines from file
while (!line.empty())
{
std::vector<std::string> temp;
// Add x lines from file to temporary vector
for (int j = 0; j < x; j++)
{
std::getline(file, line);
temp.push_back(line);
}
// Add temp vector storing x lines of the file to another vector
FileSectionVec.push_back(temp);
}