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 26, 2026 22:51Victor MerckléVictor MerckléScore: 9,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:529,33885,620,19175,486,0002,021,0002,117,632stderr
2Aug 26, 2026 22:529,34485,938,51975,540,0002,021,0002,117,632stderr
3Aug 26, 2026 22:529,35085,741,46475,587,0002,019,0002,117,632stderr
4Aug 26, 2026 22:529,35685,856,60275,638,0002,018,0002,117,632stderr
5Aug 26, 2026 22:529,37086,157,55375,755,0002,022,0002,117,632stderr
6Aug 26, 2026 22:529,37186,161,53975,760,0002,024,0002,117,632stderr
7Aug 26, 2026 22:529,39086,256,36475,924,0002,021,0002,117,632stderr
8Aug 26, 2026 22:529,56187,752,04177,339,0002,018,0002,117,632stderr
9Aug 26, 2026 22:529,76889,351,19779,065,0002,016,0002,117,632stderr