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 listAug 23, 2021 10:17Aleksey AkulovichAleksey AkulovichScore: 399,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2021 10:17398,5174,078,001,5703,307,692,99702,265,088
2Aug 23, 2021 10:17399,9554,089,568,7623,319,624,43002,297,856
3Aug 23, 2021 10:17402,5384,050,660,8243,341,069,26502,260,992