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 listJul 15, 2022 23:45Yuriy LyfenkoYuriy LyfenkoScore: 73,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 23:4573,005667,388,656605,941,16002,293,760
2Jul 15, 2022 23:4573,192675,159,297607,497,27302,285,568
3Jul 15, 2022 23:4573,193672,391,460607,500,41502,293,760