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 18:44marko1597marko1597Score: 4,651Success
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 18:444,59046,598,82337,063,0001,035,0002,117,632
2Aug 16, 2026 18:444,61746,670,08137,218,0001,108,0002,117,632
3Aug 16, 2026 18:444,62346,761,47237,312,0001,065,0002,117,632
4Aug 16, 2026 18:444,64758,200,42637,477,0001,097,0002,117,632
5Aug 16, 2026 18:444,65148,201,16837,472,0001,132,0002,117,632
6Aug 16, 2026 18:444,66747,122,07237,699,0001,038,0002,117,632
7Aug 16, 2026 18:444,71747,376,27738,041,0001,114,0002,117,632
8Aug 16, 2026 18:444,73647,555,03838,195,0001,118,0002,117,632
9Aug 16, 2026 18:444,86648,745,68339,268,0001,125,0002,117,632