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 listApr 22, 2025 17:20KeefeKeefeScore: 117,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 17:20117,4701,002,961,397974,005,0001,000,0002,269,184
2Apr 22, 2025 17:20117,5081,000,819,325971,320,0003,997,0002,400,256
3Apr 22, 2025 17:20117,5291,001,410,236972,492,0002,998,0002,392,064