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:17Yuriy LyfenkoYuriy LyfenkoScore: 17,880Success
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:1717,857172,994,013146,221,0001,989,0002,265,088
2May 17, 2021 20:1717,862295,255,651146,249,0002,003,0002,527,232
3May 17, 2021 20:1717,863471,614,177146,275,0001,990,0002,519,040
4May 17, 2021 20:1717,8771,832,433,236146,391,0001,991,0002,260,992
5May 17, 2021 20:1717,8801,160,579,865147,403,0001,002,0002,519,040
6May 17, 2021 20:1717,8802,980,834,606147,406,000995,0002,519,040
7May 17, 2021 20:1717,8851,074,453,250146,454,0001,992,0002,260,992
8May 17, 2021 20:1717,8871,117,227,853146,468,0001,992,0002,523,136
9May 17, 2021 20:1718,2741,133,018,497150,674,000997,0002,260,992