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 17, 2022 00:10Yuriy LyfenkoYuriy LyfenkoScore: 30,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 00:1030,727340,246,377255,032,31002,224,128
2Jan 17, 2022 00:1030,736325,951,921255,109,34202,207,744
3Jan 17, 2022 00:1030,741327,262,455255,148,42902,224,128