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 19, 2021 20:09Yuriy LyfenkoYuriy LyfenkoScore: 17,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:0917,4922,528,992,906144,188,000994,0002,519,040
2May 19, 2021 20:0917,496547,045,818144,221,000994,0002,265,088
3May 19, 2021 20:0917,4991,701,393,170143,240,0002,003,0002,527,232
4May 19, 2021 20:0917,5062,607,022,638141,317,0003,980,0002,265,088
5May 19, 2021 20:0917,5071,911,068,910144,312,000995,0002,519,040
6May 19, 2021 20:0917,512210,666,461144,348,0001,002,0002,519,040
7May 19, 2021 20:0917,519716,672,629141,421,0003,983,0002,519,040
8May 19, 2021 20:0917,5192,912,878,645144,409,000995,0002,260,992
9May 19, 2021 20:0917,5562,326,458,901144,713,000998,0002,519,040
10May 19, 2021 20:0917,9701,506,912,625149,151,42602,428,928
11May 19, 2021 20:0917,9861,863,130,734149,286,78102,265,088
12May 19, 2021 20:0917,9932,987,147,906149,342,12002,265,088