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 8, 2022 07:11vanderlindevanderlindeScore: 379,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2022 07:11377,7093,209,184,6843,134,982,15002,195,456
2Sep 8, 2022 07:11379,8503,216,904,1873,152,751,49902,199,552
3Sep 8, 2022 07:11381,0923,227,372,5963,163,065,53102,187,264