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 27, 2024 06:41B3NNYB3NNYScore: 378,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 06:41377,6633,198,586,3063,134,600,55102,207,744
2Jul 27, 2024 06:41378,0973,193,035,4263,138,201,61102,195,456
3Jul 27, 2024 06:41380,3133,214,677,3943,156,595,24702,330,624