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 listOct 27, 2024 10:45Xushi8Xushi8Score: 1,828,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2024 10:451,812,48815,070,400,00114,962,684,00080,965,0002,289,664
2Oct 27, 2024 10:451,824,78315,184,178,91615,066,733,00078,967,0002,281,472
3Oct 27, 2024 10:451,826,22315,190,826,07515,084,680,00072,969,0002,281,472
4Oct 27, 2024 10:451,827,22415,196,948,48115,099,988,00065,969,0002,293,760
5Oct 27, 2024 10:451,828,32215,207,341,87215,112,103,00062,971,0002,281,472
6Oct 27, 2024 10:451,829,25215,208,635,98815,116,822,00065,973,0002,289,664
7Oct 27, 2024 10:451,829,51615,216,055,31915,113,013,00071,966,0002,269,184
8Oct 27, 2024 10:451,830,83315,224,592,85415,126,950,00068,967,0002,281,472
9Oct 27, 2024 10:451,859,95715,469,975,13315,366,680,00070,966,0002,527,232