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 19, 2021 18:59Yuriy LyfenkoYuriy LyfenkoScore: 43,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 18:5943,3681,377,328,486359,955,82502,310,144
2May 19, 2021 18:5943,3902,477,609,251360,139,76702,269,184
3May 19, 2021 18:5943,3912,645,927,631360,146,75202,269,184