Project Euler Problem #12

"""
Project Euler Problem #12
==========================

The sequence of triangle numbers is generated by adding the natural
numbers. So the 7^th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 =
28. The first ten terms would be:

                 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...

Let us list the factors of the first seven triangle numbers:

   1: 1
   3: 1,3
   6: 1,2,3,6
  10: 1,2,5,10
  15: 1,3,5,15
  21: 1,3,7,21
  28: 1,2,4,7,14,28

We can see that 28 is the first triangle number to have over five
divisors.

What is the value of the first triangle number to have over five hundred
divisors?
"""

limit = 100000
data=[0] * limit
for i in xrange(1,int(limit/2+1)):
    data[i::i] = [ x+1 for x in data[i::i]]

def find():
    s = 1
    while True:
        if s % 2 == 0:
            total = data[s//2] * data[s+1]
        else:
            total = data[s]*data[(s+1)//2]
        if total > 500:
            print s*(s+1)/2
            return
        s+=1
find()

====================

running time:

$ time python 012.py 

76576500

real 0m0.119s

user 0m0.113s

sys 0m0.006s