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 11, 2021 22:45AlekseyAlekseyScore: 455,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2021 21:36455,3833,850,607,0213,779,680,80902,220,032
2Aug 11, 2021 22:45455,5153,859,847,9823,780,771,15602,215,936
3Aug 11, 2021 21:36455,7483,862,739,4753,782,708,92202,228,224
4Aug 11, 2021 21:36455,9433,845,092,8213,784,324,15502,203,648
5Aug 11, 2021 22:45457,5933,861,326,7503,798,018,63402,203,648
6Aug 11, 2021 22:45458,7693,878,378,7083,807,785,58202,199,552