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 listApr 1, 2024 15:49E SequeiraE SequeiraScore: 55,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2024 15:4954,998524,288,089456,486,05602,293,760
2Apr 1, 2024 15:3555,140511,093,704457,663,59002,293,760
3Apr 1, 2024 15:3555,154518,962,040457,776,10102,293,760
4Apr 1, 2024 15:3555,164512,380,781457,859,81402,293,760
5Apr 1, 2024 15:4155,166530,969,532457,881,43902,289,664
6Apr 1, 2024 15:4155,205531,929,232458,201,23802,285,568
7Apr 1, 2024 15:4955,891524,196,746463,897,28402,289,664
8Apr 1, 2024 15:4156,849534,698,727471,850,62702,293,760
9Apr 1, 2024 15:4956,858535,710,870471,919,76402,297,856