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 27, 2026 05:52Victor MerckléVictor MerckléScore: 4,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:524,26443,730,99534,232,0001,161,0002,117,632stderr
2Aug 27, 2026 05:524,26743,841,74334,237,0001,186,0002,117,632stderr
3Aug 27, 2026 05:524,27343,793,87234,288,0001,184,0002,117,632stderr
4Aug 27, 2026 05:524,28344,460,47534,451,0001,103,0002,117,632stderr
5Aug 27, 2026 05:524,30244,060,15634,598,0001,110,0002,117,632stderr
6Aug 27, 2026 05:524,30644,106,64834,616,0001,124,0002,117,632stderr
7Aug 27, 2026 05:524,42845,111,53835,596,0001,160,0002,117,632stderr
8Aug 27, 2026 05:524,50546,510,02536,255,0001,141,0002,117,632stderr
9Aug 27, 2026 05:524,51645,770,09236,380,0001,111,0002,117,632stderr