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:16Yuriy LyfenkoYuriy LyfenkoScore: 17,882Success
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:1617,8553,083,449,413146,208,0001,989,0002,523,136
2May 17, 2021 20:1617,873729,031,212146,359,0001,991,0002,519,040
3May 17, 2021 20:1617,880314,610,565148,401,00002,527,232
4May 17, 2021 20:1617,8812,366,683,331148,409,00002,519,040
5May 17, 2021 20:1617,8822,687,660,322147,428,000996,0002,260,992
6May 17, 2021 20:1617,8832,727,010,095146,433,0001,992,0002,256,896
7May 17, 2021 20:1617,8831,462,733,355146,433,0001,992,0002,519,040
8May 17, 2021 20:1617,8882,825,965,495147,478,000996,0002,260,992
9May 17, 2021 20:1617,8921,020,824,711145,517,0002,990,0002,256,896