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 listOct 19, 2022 16:23Kyle SoskinKyle SoskinScore: 305,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2022 16:23305,1062,591,910,1282,532,377,66002,269,184
2Oct 19, 2022 16:23305,1522,606,844,0412,532,764,25102,232,320
3Oct 19, 2022 16:23305,9402,603,189,5542,539,300,39702,207,744