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 6, 2026 21:50TonyTonyScore: 7,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 21:507,86075,085,12763,073,0002,169,0002,113,536
2Aug 6, 2026 21:507,86875,072,98763,168,0002,137,0002,113,536
3Aug 6, 2026 21:507,87075,074,08663,184,0002,140,0002,113,536
4Aug 6, 2026 21:507,87875,083,44263,243,0002,147,0002,113,536
5Aug 6, 2026 21:507,90375,371,61363,422,0002,176,0002,113,536
6Aug 6, 2026 21:507,90775,472,26863,473,0002,160,0002,113,536
7Aug 6, 2026 21:507,91775,503,75363,555,0002,162,0002,113,536
8Aug 6, 2026 21:507,92175,483,59663,642,0002,106,0002,113,536
9Aug 6, 2026 21:507,92275,514,59963,594,0002,166,0002,113,536