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 listDec 31, 2024 12:26scompa18scompa18Score: 1,827,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2024 12:261,825,83215,190,352,05015,092,433,00061,973,0002,277,376
2Dec 31, 2024 12:261,826,22915,196,527,78315,072,734,00084,964,0002,277,376
3Dec 31, 2024 12:261,826,99415,197,727,68015,088,086,00075,965,0002,277,376
4Dec 31, 2024 12:261,827,02415,197,058,85715,093,335,00070,968,0002,277,376
5Dec 31, 2024 12:261,827,66015,199,960,85015,105,610,00063,972,0002,277,376
6Dec 31, 2024 12:261,828,16715,207,048,71915,102,818,00070,970,0002,277,376
7Dec 31, 2024 12:261,829,90315,215,961,45715,113,220,00074,971,0002,277,376
8Dec 31, 2024 12:261,831,05515,228,857,38815,132,789,00064,969,0002,277,376
9Dec 31, 2024 12:261,835,63915,267,821,11615,164,838,00070,966,0002,289,664