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 4, 2024 10:48marsmarsScore: 403,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 10:48402,8123,371,097,8553,277,369,00065,967,0002,285,568
2Dec 4, 2024 10:48402,9373,366,674,8353,286,404,00057,971,0002,285,568
3Dec 4, 2024 10:48402,9723,369,881,9463,275,698,00068,972,0002,285,568
4Dec 4, 2024 10:48402,9953,369,518,7953,290,881,00053,981,0002,285,568
5Dec 4, 2024 10:48403,4083,378,237,5533,288,314,00059,969,0002,371,584
6Dec 4, 2024 10:48403,6073,376,860,2323,275,988,00073,954,0002,371,584
7Dec 4, 2024 10:48404,1603,377,956,7453,293,554,00060,973,0002,285,568
8Dec 4, 2024 10:48404,5173,388,116,6263,294,519,00062,971,0002,498,560
9Dec 4, 2024 10:48503,3864,204,107,7814,107,140,00070,967,0002,281,472