Project Euler Problem 8 code failing

[GRex2595]

This is the code I have for Project Euler Problem number 8, and I'm getting 16128 as a result. I calculated one section of numbers and got 18144 and that is still not the answer, so I'm wondering if someone could point out where my problem is.

#include <iostream>
#include <fstream>
#include <string>
#include <sstream>

using namespace std;

int main()
{
	//declare variables
	ifstream googol;
	string goog;
	int max = 0;

	googol.open("Googol.txt");

	if(googol.is_open())
	{
		getline(googol, goog);
		googol.close();
	}
	else
	{
		cout << "Could not open Googol.txt\n";
		return 0;
	}//end ifs

	for(int x = 0; x < 97; x++)
	{
		stringstream digits;
		int num[5];
		int test = 1;

		digits << goog.substr(x, 5);
		for(int y = 0; y < 5; y++)
		{
			stringstream(digits.str().substr(y, 1)) >> num[y];
			test *= num[y];
		}//end for
		if(test > max)
		{
			max = test;
		}
		digits.str("");
	}//end for

	cout << max << endl;

return 0;
}//end main 

[fg109]

for(int x = 0; x < 97; x++)

You know... That's a 1000 digit number.

[GRex2595]

I probably should get my eyes checked. Thank you.

[CjKen]

If you are taking it line by line

if(googol.is_open())
	{
		getline(googol, goog);
		googol.close();
	}

you should remember that the value given is in rows of 50 digits, so I don't know if you have formatted the text document correctly. Can you paste your text document?

for(int x = 0; x < 97; x++) // WHY 97?
	{
		stringstream digits;
		int num[5];
		int test = 1;

		digits << goog.substr(x, 5);
		for(int y = 0; y < 5; y++)
		{
			stringstream(digits.str().substr(y, 1)) >> num[y];
			test *= num[y];
		}//end for
		if(test > max)
		{
			max = test;
		}
		digits.str("");
	}//end for 

HA! I just now solved that one by staring at it for a minute!

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

from 9*9*8*7*9 you get 40824

[GRex2595]

Formatted to one line, and I was doing some testing by changing numbers to see if that affected anything.