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,399Success
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:405,29654,051,50242,807,0001,151,0002,113,536
2Aug 16, 2026 13:405,29754,032,29642,821,0001,150,0002,113,536
3Aug 16, 2026 13:405,30053,991,23542,849,0001,141,0002,113,536
4Aug 16, 2026 13:405,32254,173,17443,032,0001,143,0002,113,536
5Aug 16, 2026 13:405,39955,731,23343,651,0001,161,0002,113,536
6Aug 16, 2026 13:405,40154,979,03843,685,0001,148,0002,113,536
7Aug 16, 2026 13:405,45855,273,20344,172,0001,137,0002,113,536
8Aug 16, 2026 13:405,46155,368,84944,185,0001,148,0002,113,536
9Aug 16, 2026 13:405,55656,852,48944,962,0001,160,0002,113,536