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 30, 2026 18:51Josu San MartinJosu San MartinScore: 5,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:525,05150,364,25040,900,0001,029,0002,113,536
2Aug 30, 2026 18:525,06850,542,85140,969,0001,102,0002,113,536
3Aug 30, 2026 18:525,07850,670,78841,127,0001,026,0002,113,536
4Aug 30, 2026 18:525,08650,708,56441,104,0001,118,0002,113,536
5Aug 30, 2026 18:525,08850,753,91141,184,0001,048,0002,113,536
6Aug 30, 2026 18:525,09250,747,80941,138,0001,131,0002,113,536
7Aug 30, 2026 18:525,11050,882,09141,293,0001,125,0002,113,536
8Aug 30, 2026 18:525,11250,889,76141,282,0001,154,0002,113,536
9Aug 30, 2026 18:525,55054,526,55645,020,0001,050,0002,113,536