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 listAug 9, 2026 17:44TonyTonyScore: 6,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 17:446,44063,414,93550,838,0002,619,0002,113,536
2Aug 9, 2026 17:446,48163,771,29351,178,0002,619,0002,113,536
3Aug 9, 2026 17:446,52064,856,16652,080,0002,036,0002,113,536
4Aug 9, 2026 17:446,61264,891,00652,237,0002,648,0002,113,536
5Aug 9, 2026 17:446,65265,977,79553,179,0002,033,0002,113,536
6Aug 9, 2026 17:446,65465,268,24252,609,0002,625,0002,113,536
7Aug 9, 2026 17:446,67765,391,10352,803,0002,620,0002,113,536
8Aug 9, 2026 17:446,70766,383,78653,635,0002,035,0002,113,536
9Aug 9, 2026 17:446,72066,514,47853,702,0002,076,0002,113,536