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 listApr 18, 2023 04:50Aaron LoviAaron LoviScore: 50,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2023 04:5050,757496,648,078421,282,46102,289,664
2Apr 18, 2023 04:5050,762496,947,398421,324,26702,297,856
3Apr 18, 2023 04:5050,791485,882,040421,568,63002,277,376
4Apr 18, 2023 04:5250,791481,978,134421,562,27302,285,568
5Apr 18, 2023 04:5050,795482,368,352421,601,69902,289,664
6Apr 18, 2023 04:5250,796494,257,808421,606,44202,289,664
7Apr 18, 2023 04:5050,814480,426,487421,757,41602,293,760
8Apr 18, 2023 04:5050,839478,070,853421,964,06002,281,472
9Apr 18, 2023 04:5250,845485,293,135422,015,63802,289,664