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 1, 2023 17:51Yuriy LyfenkoYuriy LyfenkoScore: 78,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2023 17:5178,648718,343,526652,781,21902,240,512
2Dec 1, 2023 17:5178,670727,067,585652,957,98602,240,512
3Dec 1, 2023 17:5179,471729,705,692659,608,72702,244,608