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:42Yuriy LyfenkoYuriy LyfenkoScore: 17,495Success
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:4217,4901,803,542,468144,170,0001,001,0002,260,992
2May 17, 2021 20:4217,4922,088,841,229144,187,000994,0002,260,992
3May 17, 2021 20:4217,4952,954,067,601144,205,0001,001,0002,527,232
4May 17, 2021 20:4217,4951,869,933,364144,207,0001,001,0002,260,992
5May 17, 2021 20:4217,495664,751,894144,210,0001,001,0002,256,896
6May 17, 2021 20:4217,496986,286,899142,231,0002,983,0002,260,992
7May 17, 2021 20:4217,496712,347,647143,227,0001,989,0002,519,040
8May 17, 2021 20:4217,4992,398,884,146144,250,000994,0002,519,040
9May 17, 2021 20:4217,5202,054,252,522145,418,00002,523,136