![]() ![]() However you might be able to duplicate the error with just the vector allocation. ![]() On a 3570k 4.2GHz running 100 billion in visual studio takes around 30 mins, 1 billion around 10 seconds. Note: if you are going to try and run this yourself, it can take quite a long time. Warranty not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. This is free software see the source for copying conditions. Ive had several segmentation violations while running it, and the file selection box sometimes loses its state entirely during a long run with many files open, requiring exit and restart before it becomes useful again. sieve.exe 17000000000Ĭopyright (C) 2013 Free Software Foundation, Inc. NEdit is a work in progress and appears to have some memory allocation problems. Works fine (using 2,079,968 K memory according to task manager, though my reputation doesn't allow me to post a third link.) $. I'm fairly sure it's running as a 64 bit process as there's no *32 next to the process name in task manager.Ĭonst long long ONE_BILLION = 1000*1000*1000 However, when compiled with g++ in cygwin64 on Windows 7 Home Premium 64 bit, a segmentation fault occurs when attempting to use more than ~2GB ram (running the sieve for > ~17,000,000,000) The program works fine when compiled with Visual Studio 2012 (in a project set up for 圆4) as well as g++ on 64 bit linux. ![]() I've written a prime sieve program in c++, which uses ~12GB ram to calculate all primes below 100,000,000,000 (100 Billion).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |