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 12, 2026 06:37Victor MerckléVictor MerckléScore: 3,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:383,77539,781,19030,147,0001,190,0002,117,632stderr
2Aug 12, 2026 06:383,77739,792,80130,207,0001,145,0002,117,632stderr
3Aug 12, 2026 06:383,78039,779,09230,284,0001,094,0002,117,632stderr
4Aug 12, 2026 06:383,78539,823,86430,315,0001,101,0002,117,632stderr
5Aug 12, 2026 06:383,78939,849,41130,341,0001,108,0002,117,632stderr
6Aug 12, 2026 06:383,80340,026,12230,460,0001,109,0002,117,632stderr
7Aug 12, 2026 06:383,83440,249,06730,650,0001,175,0002,117,632stderr
8Aug 12, 2026 06:383,83740,233,73630,752,0001,097,0002,117,632stderr
9Aug 12, 2026 06:383,89340,714,55031,197,0001,115,0002,117,632stderr