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 21:23Josu San MartinJosu San MartinScore: 4,272Success
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 21:274,25943,776,22834,304,0001,048,0002,113,536
2Aug 30, 2026 21:274,25943,823,22134,322,0001,035,0002,113,536
3Aug 30, 2026 21:274,26343,889,15334,359,0001,030,0002,113,536
4Aug 30, 2026 21:274,26943,938,58234,368,0001,072,0002,113,536
5Aug 30, 2026 21:274,27243,966,12034,337,0001,128,0002,113,536
6Aug 30, 2026 21:274,28044,088,46234,432,0001,096,0002,113,536
7Aug 30, 2026 21:274,30144,172,55534,598,0001,105,0002,113,536
8Aug 30, 2026 21:274,31344,198,99834,773,0001,030,0002,113,536
9Aug 30, 2026 21:274,35144,744,01634,988,0001,128,0002,113,536