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 listSep 3, 2021 14:10Ilya AniskovetsIlya AniskovetsScore: 47,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 16:3847,312449,740,970392,687,66202,256,896
2Sep 3, 2021 14:1047,442454,245,092393,764,63202,265,088
3Sep 3, 2021 16:3847,490453,806,525394,168,09802,273,280
4Sep 3, 2021 16:3847,550469,724,144394,664,64702,260,992
5Sep 3, 2021 14:1047,659466,109,266395,565,98802,265,088
6Sep 3, 2021 14:1047,691457,548,982395,836,70002,265,088