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 16, 2024 16:06mberman12mberman12Score: 1,828,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 16:061,823,51115,168,579,90015,063,172,00071,972,0002,269,184
2Sep 16, 2024 16:061,826,55415,193,841,08515,088,428,00071,973,0002,285,568
3Sep 16, 2024 16:061,826,60515,189,671,96015,092,852,00067,972,0002,285,568
4Sep 16, 2024 16:061,826,95015,199,546,57615,087,726,00075,963,0002,281,472
5Sep 16, 2024 16:061,828,13815,204,328,19815,108,574,00064,968,0002,281,472
6Sep 16, 2024 16:061,828,62315,215,247,69415,106,603,00070,969,0002,293,760
7Sep 16, 2024 16:061,828,87815,214,249,81015,116,715,00062,973,0002,523,136
8Sep 16, 2024 16:061,829,14615,214,102,05215,117,936,00063,974,0002,285,568
9Sep 16, 2024 16:061,832,06615,235,254,84315,151,171,00054,975,0002,281,472