Find largest sum of subsequence
Python, 91 84 64 chars

s=m=0
try:
 while 1:s=max(s+input(),0);m=max(m,s)
except:print m


Takes about 14 12 72 seconds on the last test case.  Edit: using algorithm Paul R found. Edit: nixed the import, using input().