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 listJan 16, 2022 17:19Yuriy LyfenkoYuriy LyfenkoScore: 32,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 17:1932,197343,227,579267,238,49802,207,744
2Jan 16, 2022 17:1932,197339,483,133267,235,98502,220,032
3Jan 16, 2022 17:1932,215338,710,518267,385,58102,211,840