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 7, 2024 09:14PatrikPatrikScore: 365,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2024 09:14364,1423,048,477,5742,962,410,00059,967,000184,320
2Sep 7, 2024 09:14364,4743,049,970,8322,980,161,00044,972,0002,289,664
3Sep 7, 2024 09:14364,8143,052,443,4882,966,980,00060,979,000192,512
4Sep 7, 2024 09:14364,9173,053,323,1402,963,836,00064,974,000270,336
5Sep 7, 2024 09:14365,1033,061,276,9792,970,392,00059,967,000266,240
6Sep 7, 2024 09:14365,2233,059,238,9922,961,391,00069,961,000184,320
7Sep 7, 2024 09:14367,1263,080,428,6512,991,165,00055,984,000192,512
8Sep 7, 2024 09:14367,1743,074,293,9892,975,577,00071,965,000184,320
9Sep 7, 2024 09:14378,1653,171,547,0333,074,794,00063,974,0002,363,392