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 listJun 2, 2021 18:45Yuriy LyfenkoYuriy LyfenkoScore: 17,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2021 18:4517,4001,203,771,204144,419,14302,244,608
2Jun 2, 2021 18:4517,4031,200,526,717144,441,98102,240,512
3Jun 2, 2021 18:4517,4121,207,578,269144,523,41102,244,608
4Jun 2, 2021 18:4517,5011,175,435,957144,258,0001,001,0002,260,992
5Jun 2, 2021 18:4517,5031,172,733,502144,272,0001,001,0002,260,992
6Jun 2, 2021 18:4517,5111,172,470,448144,337,0001,002,0002,510,848
7Jun 2, 2021 18:4517,5171,167,502,013144,391,0001,002,0002,260,992
8Jun 2, 2021 18:4517,5181,174,253,327143,406,0001,991,0002,392,064
9Jun 2, 2021 18:4517,5211,172,738,762144,423,0001,002,0002,260,992
10Jun 2, 2021 18:4517,5261,170,552,769143,470,0001,992,0002,527,232
11Jun 2, 2021 18:4517,5451,173,261,958143,626,0001,994,0002,383,872
12Jun 2, 2021 18:4517,5491,175,347,887145,655,00002,527,232