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 listJun 29, 2021 06:16Yuriy LyfenkoYuriy LyfenkoScore: 114,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 06:16114,7111,020,344,295952,104,73102,224,128
2Jun 29, 2021 06:16114,8981,009,351,172953,655,62502,215,936
3Jun 29, 2021 06:16115,1751,016,205,126955,953,25502,215,936