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 17, 2021 20:45Yuriy LyfenkoYuriy LyfenkoScore: 17,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:4517,243668,671,030143,119,00002,260,992
2May 17, 2021 20:4517,2531,998,292,593142,199,0001,001,0002,260,992
3May 17, 2021 20:4517,257562,765,094143,229,00002,260,992
4May 17, 2021 20:4517,2601,343,903,916141,266,0001,989,0002,260,992
5May 17, 2021 20:4517,2621,330,116,411142,282,000994,0002,265,088
6May 17, 2021 20:4517,2682,316,003,186141,335,0001,990,0002,387,968
7May 17, 2021 20:4517,2741,038,331,846139,396,0003,982,0002,260,992
8May 17, 2021 20:4517,3491,452,782,956141,018,0002,979,0002,519,040
9May 17, 2021 20:4517,3772,913,526,342143,231,000994,0002,519,040