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 listMay 17, 2026 21:23zielajzielajScore: 3,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:233,28936,960,92926,259,0001,044,0002,113,536
2May 17, 2026 21:233,30036,600,36926,358,0001,033,0002,113,536
3May 17, 2026 21:233,30835,785,59626,393,0001,064,0002,113,536
4May 17, 2026 21:233,31635,816,92526,508,0001,017,0002,113,536
5May 17, 2026 21:233,32237,524,35326,505,0001,075,0002,113,536
6May 17, 2026 21:233,35136,099,65826,771,0001,043,0002,113,536
7May 17, 2026 21:233,46137,178,20427,676,0001,053,0002,113,536
8May 17, 2026 21:233,49838,283,70728,026,0001,009,0002,113,536
9May 17, 2026 21:233,50638,739,52428,082,0001,019,0002,113,536