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 16, 2024 09:22Huy Duc LeHuy Duc LeScore: 13,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 09:2213,854181,243,409114,992,08002,285,568
2Feb 16, 2024 09:2213,855181,574,904114,994,91002,285,568
3Feb 16, 2024 09:2213,857180,706,299115,013,13202,289,664