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 listMay 27, 2024 14:02Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 14:0300000Error: Exit with code 1: Segmentation fault at address: 71311376stderr
2May 27, 2024 14:0500000Error: Exit with code 1: Segmentation fault at address: 268599328stderr
3May 27, 2024 14:0700000Error: expected "53688199411670251 ", got "53688247636410706 "
4May 27, 2024 14:026,436119,204,83953,418,25202,215,936
5May 27, 2024 14:046,467117,979,65253,678,27602,334,720
6May 27, 2024 14:026,554109,691,96154,401,49102,228,224
7May 27, 2024 14:046,580120,984,31754,617,65702,207,744
8May 27, 2024 14:046,591131,625,86854,706,36602,224,128
9May 27, 2024 14:026,655118,170,90455,238,77002,236,416