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:18Josu San MartinJosu San MartinScore: 4,283Success
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:184,25343,704,12634,260,0001,040,0002,113,536
2Aug 30, 2026 21:184,25443,761,78834,269,0001,043,0002,113,536
3Aug 30, 2026 21:184,25843,799,28934,318,0001,031,0002,113,536
4Aug 30, 2026 21:184,26143,757,65934,324,0001,044,0002,113,536
5Aug 30, 2026 21:184,28344,037,96834,520,0001,033,0002,113,536
6Aug 30, 2026 21:184,28744,040,89934,548,0001,040,0002,113,536
7Aug 30, 2026 21:184,29344,133,58034,504,0001,130,0002,113,536
8Aug 30, 2026 21:184,29644,173,13134,616,0001,046,0002,113,536
9Aug 30, 2026 21:184,30844,255,02634,710,0001,049,0002,113,536