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:23Huy Duc LeHuy Duc LeScore: 13,935Success
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:2313,922192,921,931115,554,14702,285,568
2Feb 16, 2024 09:2313,935171,625,346115,664,05002,285,568
3Feb 16, 2024 09:2314,104179,842,135117,059,09502,252,800