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 listMay 12, 2026 04:36Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 04:36041,860,27632,405,0001,044,0002,113,536expected "53691130615446663 ", got "53691348413359804 "
2May 12, 2026 04:364,01641,162,34532,292,0001,044,0002,113,536
3May 12, 2026 04:364,05042,423,92532,542,0001,078,0002,113,536
4May 12, 2026 04:364,05743,203,03732,631,0001,045,0002,113,536
5May 12, 2026 04:364,07141,124,43032,720,0001,073,0002,113,536
6May 12, 2026 04:364,07543,205,09232,749,0001,077,0002,113,536
7May 12, 2026 04:364,07743,290,02932,752,0001,092,0002,113,536
8May 12, 2026 04:364,11242,749,22633,097,0001,037,0002,113,536
9May 12, 2026 04:367,35370,376,16859,943,0001,092,0002,113,536