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 26, 2022 18:46berry_hibiscusberry_hibiscusScore: 702,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2022 18:46701,58716,515,368,1655,823,168,08702,273,280
2Sep 26, 2022 18:46702,09116,009,978,9615,827,353,59702,224,128
3Sep 26, 2022 18:46704,63215,484,707,8925,848,444,91502,215,936