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:14Josu San MartinJosu San MartinScore: 4,533Success
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:144,47245,485,60236,080,0001,042,0002,113,536
2Aug 30, 2026 18:144,50145,777,79336,245,0001,116,0002,113,536
3Aug 30, 2026 18:144,53046,003,92036,489,0001,116,0002,113,536
4Aug 30, 2026 18:144,53246,112,37636,488,0001,135,0002,113,536
5Aug 30, 2026 18:144,53346,053,76036,508,0001,117,0002,113,536
6Aug 30, 2026 18:144,53546,077,19036,524,0001,124,0002,113,536
7Aug 30, 2026 18:144,53846,134,67136,553,0001,113,0002,113,536
8Aug 30, 2026 18:144,53946,110,27536,672,0001,004,0002,113,536
9Aug 30, 2026 18:144,55046,262,24336,628,0001,137,0002,113,536