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 listJul 5, 2021 15:36Yuriy LyfenkoYuriy LyfenkoScore: 43,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2021 15:3643,831424,707,802363,799,17102,211,840
2Jul 5, 2021 15:3643,857423,372,695364,012,52402,224,128
3Jul 5, 2021 15:3643,873424,383,814364,148,74402,220,032