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 2, 2026 17:32boop34boop34Score: 9,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:339,82891,537,12280,555,0001,019,0002,113,536
2Aug 2, 2026 17:339,85491,642,19280,676,0001,118,0002,113,536
3Aug 2, 2026 17:339,85891,664,30180,613,0001,212,0002,113,536
4Aug 2, 2026 17:339,86091,709,26280,638,0001,203,0002,113,536
5Aug 2, 2026 17:339,86391,857,97480,864,0001,007,0002,113,536
6Aug 2, 2026 17:339,86491,683,41880,663,0001,212,0002,113,536
7Aug 2, 2026 17:339,87491,916,40480,679,0001,278,0002,113,536
8Aug 2, 2026 17:339,88091,862,48480,811,0001,194,0002,113,536
9Aug 2, 2026 17:339,89491,945,50280,934,0001,190,0002,113,536