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 10, 2022 05:45Yuriy LyfenkoYuriy LyfenkoScore: 13,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 05:4513,261181,462,366110,068,07502,285,568
2Jan 10, 2022 05:4513,268179,580,063110,121,38202,269,184
3Jan 10, 2022 05:4513,271184,397,329110,145,55302,265,088