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 16, 2026 13:19marko1597marko1597Score: 5,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:495,39854,815,93543,652,0001,154,0002,113,536
2Aug 16, 2026 13:495,40054,822,53743,656,0001,164,0002,113,536
3Aug 16, 2026 13:495,40555,663,82543,715,0001,149,0002,113,536
4Aug 16, 2026 13:495,41654,949,23343,789,0001,165,0002,113,536
5Aug 16, 2026 13:495,42155,075,61143,856,0001,143,0002,113,536
6Aug 16, 2026 13:495,45055,987,58144,086,0001,152,0002,113,536
7Aug 16, 2026 13:495,46655,901,99044,225,0001,147,0002,113,536
8Aug 16, 2026 13:495,49355,631,35544,442,0001,152,0002,113,536
9Aug 16, 2026 13:495,56356,511,32345,036,0001,145,0002,113,536