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 12, 2024 09:53asssasssScore: 1,828,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 09:531,823,31515,168,147,90515,069,537,00063,976,0002,269,184
2Sep 12, 2024 09:531,825,40115,183,369,18515,086,858,00063,973,0002,281,472
3Sep 12, 2024 09:531,826,04115,192,550,76915,103,161,00052,979,0002,289,664
4Sep 12, 2024 09:531,826,58615,193,854,33815,099,690,00060,974,0002,281,472
5Sep 12, 2024 09:531,828,19115,206,882,21515,103,016,00070,971,0002,281,472
6Sep 12, 2024 09:531,828,56315,206,092,75415,107,101,00069,972,0002,281,472
7Sep 12, 2024 09:531,829,73515,220,270,15615,123,823,00062,974,0002,289,664
8Sep 12, 2024 09:531,829,90815,223,155,17915,115,273,00072,962,0002,269,184
9Sep 12, 2024 09:531,928,62616,040,146,14715,943,629,00063,970,0002,289,664