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 2, 2026 20:19leoweleoweScore: 137,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 20:19135,8211,167,929,638706,573,000420,745,0002,347,008
2Apr 2, 2026 20:19137,4871,180,945,075723,822,000417,320,0002,293,760
3Apr 2, 2026 20:19139,4961,198,532,069760,255,000397,564,0002,334,720