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 30, 2021 08:12piculpiculScore: 1,641,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2021 08:121,641,38813,701,029,10013,623,517,31902,256,896
2Aug 30, 2021 08:121,641,64813,690,337,19013,625,681,39302,256,896
3Aug 30, 2021 08:121,642,78413,712,358,61113,635,110,50802,256,896