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 5, 2021 15:52Yuriy LyfenkoYuriy LyfenkoScore: 39,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2021 15:5239,379395,800,887326,842,18202,215,936
2Jul 5, 2021 15:5239,408393,768,444327,090,24002,215,936
3Jul 5, 2021 15:5239,449393,887,584327,428,41502,215,936