I’m quite new to python, so I’m doing my usual of going through Project Euler to work out the logical kinks in my head.
Basically, I need the largest list size possible, ie range(1,n), without overflowing.
Any ideas?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’m quite new to python, so I’m doing my usual of going through Project Euler to work out the logical kinks in my head.
Basically, I need the largest list size possible, ie range(1,n), without overflowing.
Any ideas?
Look at get_len_of_range and get_len_of_range_longs in the builtin module source
Summary: You’ll get an OverflowError if the list has more elements than can be fit into a signed long. On 32bit Python that’s
2**31 - 1, and on 64 bit Python that’s2**63 - 1. Of course, you will get a MemoryError even for values just under that.