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 16, 2026 13:16marko1597marko1597Score: 5,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:395,29554,029,39942,822,0001,132,0002,113,536
2Aug 16, 2026 13:395,29853,949,50042,839,0001,137,0002,113,536
3Aug 16, 2026 13:395,31654,095,73742,980,0001,149,0002,113,536
4Aug 16, 2026 13:395,31754,167,05543,060,0001,078,0002,113,536
5Aug 16, 2026 13:395,31754,868,77343,007,0001,131,0002,113,536
6Aug 16, 2026 13:395,40354,906,38543,702,0001,146,0002,113,536
7Aug 16, 2026 13:395,40354,854,55943,696,0001,151,0002,113,536
8Aug 16, 2026 13:395,45655,285,18744,157,0001,135,0002,113,536
9Aug 16, 2026 13:395,46555,421,07644,222,0001,139,0002,113,536