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 15, 2021 20:06Malik ShamsutdinovMalik ShamsutdinovScore: 835,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 20:06818,4756,848,342,7266,793,339,63302,183,168
2Sep 15, 2021 20:06835,1706,996,248,8736,931,913,10502,306,048
3Sep 15, 2021 20:06835,2466,999,200,3626,932,542,54302,256,896