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 listJan 12, 2023 11:25Kevin HeaveyKevin HeaveyScore: 56,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2023 11:2556,368544,986,429467,852,40102,224,128
2Jan 12, 2023 11:3756,395530,224,665468,078,10002,224,128
3Jan 12, 2023 11:3756,401541,354,505468,126,44902,215,936
4Jan 12, 2023 11:3756,418534,154,339468,265,96402,265,088
5Jan 12, 2023 11:2556,432526,098,866468,388,40302,265,088
6Jan 12, 2023 11:2556,443524,319,518468,475,81102,224,128
7Jan 12, 2023 11:2556,458546,426,714468,599,99302,215,936
8Jan 12, 2023 11:2556,459553,404,605468,613,43402,224,128
9Jan 12, 2023 11:2556,467524,306,778468,676,72402,224,128