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 10, 2023 15:37igorfardocigorfardocScore: 37,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 15:3535,169380,881,087291,904,84302,293,760
2Aug 10, 2023 15:3436,985370,743,811306,977,06002,289,664
3Aug 10, 2023 15:3737,004378,336,409307,135,31802,289,664
4Aug 10, 2023 15:3537,007379,335,577307,156,11002,277,376
5Aug 10, 2023 15:3437,018369,825,330307,250,09602,293,760
6Aug 10, 2023 15:3737,034367,333,782307,385,28802,297,856
7Aug 10, 2023 15:3537,037385,871,931307,404,43502,285,568
8Aug 10, 2023 15:3437,047370,578,156307,491,23102,293,760
9Aug 10, 2023 15:3737,050375,304,819307,514,54902,285,568