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 10, 2026 16:49arwdjarwdjScore: 41,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 16:4941,012368,912,257339,397,0001,001,0002,281,472
2Apr 10, 2026 16:4941,017368,660,312339,446,000998,0002,392,064
3Apr 10, 2026 16:4941,022365,576,644339,480,0001,001,0002,281,472