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:20Yuriy LyfenkoYuriy LyfenkoScore: 18,127Success
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:2018,1222,159,256,503146,425,0003,984,0002,256,896
2May 17, 2021 20:2018,1242,635,896,421148,421,0002,005,0002,265,088
3May 17, 2021 20:2018,1241,238,976,250150,433,00002,396,160
4May 17, 2021 20:2018,1261,521,860,824147,460,0002,989,0002,527,232
5May 17, 2021 20:2018,1271,286,498,987148,461,0001,992,0002,523,136
6May 17, 2021 20:2018,1271,145,824,063147,462,0002,989,0002,260,992
7May 17, 2021 20:2018,1321,264,699,877149,501,000996,0002,519,040
8May 17, 2021 20:2018,1511,828,624,266149,653,000997,0002,260,992
9May 17, 2021 20:2018,253199,016,971150,498,0001,003,0002,265,088