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 25, 2024 06:23DavidDavidScore: 1,827,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2024 06:231,825,58615,191,678,90015,082,392,00069,969,0002,293,760
2Oct 25, 2024 06:231,826,09815,197,282,87115,078,649,00077,961,0002,281,472
3Oct 25, 2024 06:231,826,16215,190,254,85915,098,168,00058,977,0002,281,472
4Oct 25, 2024 06:231,826,40715,189,654,91315,103,196,00055,978,0002,289,664
5Oct 25, 2024 06:231,827,97415,202,859,34015,088,220,00083,967,0002,281,472
6Oct 25, 2024 06:231,829,21315,217,941,90715,119,490,00062,977,0002,265,088
7Oct 25, 2024 06:231,829,97615,225,221,12415,124,828,00063,973,0002,281,472
8Oct 25, 2024 06:231,832,97915,243,782,50715,129,763,00083,965,0002,281,472
9Oct 25, 2024 06:231,838,07215,286,851,88115,191,025,00064,970,0002,289,664