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 28, 2024 18:50Steve HanSteve HanScore: 18,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 18:5618,076218,964,902150,027,53402,293,760
2Apr 28, 2024 18:5018,115216,470,292150,352,59402,297,856
3Apr 28, 2024 18:5018,128217,134,782150,463,78002,297,856
4Apr 28, 2024 18:5018,148229,410,365150,627,75202,297,856
5Apr 28, 2024 18:5618,152207,455,742150,659,69002,297,856
6Apr 28, 2024 18:5618,168221,598,584150,797,34302,293,760
7Apr 28, 2024 18:5618,184214,607,534150,928,65002,297,856
8Apr 28, 2024 18:5618,195215,923,865151,020,00502,297,856
9Apr 28, 2024 18:5618,240212,247,326151,395,67502,297,856