Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 11, 2026 18:29Victor MerckléVictor MerckléScore: 4,121Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 18:304,05642,038,50332,540,0001,126,0002,117,632stderr
2Aug 11, 2026 18:304,08542,919,31532,705,0001,206,0002,117,632stderr
3Aug 11, 2026 18:304,10142,397,92932,782,0001,259,0002,117,632stderr
4Aug 11, 2026 18:304,11042,529,30932,946,0001,167,0002,117,632stderr
5Aug 11, 2026 18:304,12142,634,32933,099,0001,110,0002,117,632stderr
6Aug 11, 2026 18:304,12442,708,88733,108,0001,122,0002,117,632stderr
7Aug 11, 2026 18:304,15042,792,50833,315,0001,134,0002,117,632stderr
8Aug 11, 2026 18:304,15642,851,23933,373,0001,129,0002,117,632stderr
9Aug 11, 2026 18:304,39744,925,07535,389,0001,108,0002,117,632stderr