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 11, 2022 20:25Jakub BeránekJakub BeránekScore: 398,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2022 20:25397,4163,352,431,7643,298,549,44502,183,168
2Jan 11, 2022 20:25398,7483,377,491,4123,309,605,04702,183,168
3Jan 11, 2022 20:25400,1793,397,049,2983,321,482,72502,260,992