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 20, 2021 04:11Yuriy LyfenkoYuriy LyfenkoScore: 46,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 04:1146,096440,698,058382,598,44902,215,936
2May 20, 2021 04:1146,119448,229,561382,784,10702,224,128
3May 20, 2021 04:1146,137441,690,095382,936,74902,220,032