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 listFeb 17, 2024 19:20ttttScore: 354,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2024 19:20354,8853,005,536,8712,945,544,65702,256,896
2Feb 17, 2024 19:20354,9193,013,697,3852,945,824,06002,256,896
3Feb 17, 2024 19:20355,3693,018,437,2462,949,563,19902,260,992