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 4, 2026 16:19boop34boop34Score: 9,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 16:209,04685,192,82873,866,0001,221,0002,113,536
2Aug 4, 2026 16:209,05785,090,59573,985,0001,191,0002,113,536
3Aug 4, 2026 16:209,05985,179,17374,036,0001,154,0002,113,536
4Aug 4, 2026 16:209,06185,074,97674,065,0001,144,0002,113,536
5Aug 4, 2026 16:209,06485,142,82574,118,0001,121,0002,113,536
6Aug 4, 2026 16:209,07485,116,15974,102,0001,217,0002,113,536
7Aug 4, 2026 16:209,07585,154,15874,225,0001,102,0002,113,536
8Aug 4, 2026 16:209,07685,289,44274,143,0001,189,0002,113,536
9Aug 4, 2026 16:209,08885,257,79874,326,0001,112,0002,113,536