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 listFeb 16, 2024 17:55RecursiveCatnipRecursiveCatnipScore: 56,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 17:5556,679547,183,280470,432,45202,232,320
2Feb 16, 2024 17:5556,685540,188,931470,489,00202,236,416
3Feb 16, 2024 17:5556,701527,959,653470,621,67502,236,416