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 listApr 26, 2026 15:34TudyMTudyMScore: 41,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:3441,384363,879,231341,493,0002,002,0002,387,968
2Apr 26, 2026 15:3441,386362,854,937342,503,0001,001,0002,392,064
3Apr 26, 2026 15:3441,388364,895,110341,521,0002,003,0002,383,872
4Apr 26, 2026 15:3441,389365,929,378342,532,0001,001,0002,379,776
5Apr 26, 2026 15:3441,390362,450,156342,538,0001,001,0002,383,872
6Apr 26, 2026 15:3441,396361,677,663341,592,0001,997,0002,306,048
7Apr 26, 2026 15:3441,399361,648,099341,615,0001,997,0002,383,872
8Apr 26, 2026 15:3441,404360,707,087343,655,00002,383,872
9Apr 26, 2026 15:3441,408360,668,385339,691,0003,996,0002,379,776