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 07:13marko1597marko1597Score: 5,309Success
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 07:295,30154,021,28042,856,0001,145,0002,113,536
2Aug 16, 2026 07:295,30454,037,01342,901,0001,129,0002,113,536
3Aug 16, 2026 07:295,30554,010,58442,895,0001,142,0002,113,536
4Aug 16, 2026 07:295,30554,050,46942,885,0001,147,0002,113,536
5Aug 16, 2026 07:295,30954,156,78642,934,0001,137,0002,113,536
6Aug 16, 2026 07:295,42155,031,97443,861,0001,138,0002,113,536
7Aug 16, 2026 07:295,46155,404,07444,190,0001,141,0002,113,536
8Aug 16, 2026 07:295,46555,301,05744,209,0001,152,0002,113,536
9Aug 16, 2026 07:295,46855,384,18844,250,0001,141,0002,113,536