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 25, 2026 15:57Victor MerckléVictor MerckléScore: 9,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 15:579,42786,620,57677,236,0001,010,0002,117,632stderr
2Aug 25, 2026 15:579,50587,279,74777,886,0001,009,0002,117,632stderr
3Aug 25, 2026 15:579,52787,418,26878,066,0001,011,0002,117,632stderr
4Aug 25, 2026 15:579,53388,104,94878,121,0001,011,0002,117,632stderr
5Aug 25, 2026 15:579,56387,860,99278,368,0001,011,0002,117,632stderr
6Aug 25, 2026 15:579,61488,201,31478,790,0001,010,0002,117,632stderr
7Aug 25, 2026 15:579,67589,348,64379,300,0001,010,0002,117,632stderr
8Aug 25, 2026 15:579,75389,350,58179,943,0001,011,0002,117,632stderr
9Aug 25, 2026 15:579,87590,365,10480,955,0001,011,0002,117,632stderr