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 29, 2026 17:03Josu San MartinJosu San MartinScore: 4,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:054,57655,549,56236,855,0001,126,0002,113,536
2Aug 29, 2026 17:054,59454,765,79937,022,0001,115,0002,113,536
3Aug 29, 2026 17:054,66847,122,91637,700,0001,052,0002,113,536
4Aug 29, 2026 17:054,67358,408,92237,691,0001,103,0002,113,536
5Aug 29, 2026 17:054,69547,383,43037,920,0001,056,0002,113,536
6Aug 29, 2026 17:054,70547,454,02737,996,0001,056,0002,113,536
7Aug 29, 2026 17:054,78467,785,99038,621,0001,094,0002,113,536
8Aug 29, 2026 17:054,79354,220,00638,689,0001,100,0002,113,536
9Aug 29, 2026 17:054,80455,655,54138,793,0001,085,0002,113,536