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 4, 2026 03:44Teow Hua JunTeow Hua JunScore: 6,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 03:446,92568,301,29956,357,0001,125,0002,113,536
2Aug 4, 2026 03:446,92867,574,56856,363,0001,147,0002,113,536
3Aug 4, 2026 03:446,93368,371,76756,408,0001,137,0002,113,536
4Aug 4, 2026 03:446,93368,319,99256,403,0001,146,0002,113,536
5Aug 4, 2026 03:446,93768,360,28656,440,0001,144,0002,113,536
6Aug 4, 2026 03:446,94169,140,96956,469,0001,148,0002,113,536
7Aug 4, 2026 03:446,94367,721,97556,490,0001,141,0002,113,536
8Aug 4, 2026 03:446,94567,996,34856,514,0001,136,0002,113,536
9Aug 4, 2026 03:446,94567,768,33056,507,0001,141,0002,113,536