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 listDec 21, 2021 23:07Yuriy LyfenkoYuriy LyfenkoScore: 33,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2021 23:0733,224334,330,403275,762,12402,207,744
2Dec 21, 2021 23:0733,232344,083,239275,824,27402,224,128
3Dec 21, 2021 23:0733,236340,704,567275,859,16302,215,936