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 listMay 22, 2021 16:22Yuriy LyfenkoYuriy LyfenkoScore: 40,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 16:2140,371411,335,503335,082,75602,228,224
2May 22, 2021 16:2140,371404,198,866335,076,58302,224,128
3May 22, 2021 16:2240,376416,259,718335,121,08702,207,744
4May 22, 2021 16:2140,382394,007,643335,169,74202,207,744
5May 22, 2021 16:2240,399396,938,824335,310,25102,220,032
6May 22, 2021 16:2240,408397,832,715335,387,09502,211,840