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 listDec 28, 2022 10:52Jack FrigaardJack FrigaardScore: 6,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 10:546,407117,314,59853,177,33702,289,664
2Dec 28, 2022 10:526,420111,882,55253,287,89402,293,760
3Dec 28, 2022 10:546,420119,480,76653,286,75902,179,072
4Dec 28, 2022 10:526,447112,933,12653,512,53902,297,856
5Dec 28, 2022 10:526,491108,521,32053,879,14602,179,072
6Dec 28, 2022 10:546,543114,402,21654,309,32702,293,760