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:57Josu San MartinJosu San MartinScore: 4,228Success
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:574,21843,472,44933,975,0001,038,0002,113,536
2Aug 30, 2026 21:574,22143,535,91933,992,0001,045,0002,113,536
3Aug 30, 2026 21:574,22443,630,48234,019,0001,046,0002,113,536
4Aug 30, 2026 21:574,22543,437,65334,037,0001,031,0002,113,536
5Aug 30, 2026 21:574,22843,609,37434,040,0001,057,0002,113,536
6Aug 30, 2026 21:574,23243,635,66634,057,0001,071,0002,113,536
7Aug 30, 2026 21:574,24343,676,93834,170,0001,050,0002,113,536
8Aug 30, 2026 21:574,24649,444,80134,206,0001,044,0002,113,536
9Aug 30, 2026 21:574,25643,795,70934,187,0001,142,0002,113,536