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 28, 2021 21:39Yuriy LyfenkoYuriy LyfenkoScore: 17,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2021 21:3917,121168,177,934140,103,0002,001,0002,260,992
2May 28, 2021 21:3917,136173,869,287141,224,0001,001,0002,260,992
3May 28, 2021 21:3917,136173,217,775140,229,0002,003,0002,519,040
4May 28, 2021 21:3917,144167,808,774142,297,00002,260,992
5May 28, 2021 21:3917,261170,012,806142,267,0001,001,0002,392,064
6May 28, 2021 21:3917,468170,971,768143,987,000999,0002,260,992
7May 28, 2021 21:3917,470175,533,197143,000,0002,000,0002,260,992
8May 28, 2021 21:3917,476172,848,354144,053,0001,000,0002,260,992
9May 28, 2021 21:3917,490171,751,000145,167,00002,387,968
10May 28, 2021 21:3917,587202,712,910145,973,74402,256,896
11May 28, 2021 21:3917,589187,860,697145,984,77202,265,088
12May 28, 2021 21:3918,337191,561,064152,198,32902,265,088