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 listMay 5, 2021 22:51Yuriy LyfenkoYuriy LyfenkoScore: 19,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 22:5119,733189,182,181160,766,0003,014,0002,260,992
2May 5, 2021 22:5119,734190,183,603161,795,0001,997,0002,506,752
3May 5, 2021 22:5119,788189,251,845164,240,00002,260,992
4May 5, 2021 22:5119,889193,309,333163,078,0002,000,0002,260,992
5May 5, 2021 22:5119,889190,589,965162,080,0003,001,0002,400,256
6May 5, 2021 22:5119,897193,145,792163,143,0002,001,0002,387,968
7May 5, 2021 22:5119,908188,892,499164,235,0001,001,0002,260,992
8May 5, 2021 22:5119,911195,792,632164,264,0001,001,0002,260,992
9May 5, 2021 22:5119,929187,673,587165,408,00002,260,992