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 listDec 6, 2023 02:24Yuriy LyfenkoYuriy LyfenkoScore: 7,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 02:247,28983,350,10358,486,0002,016,0002,306,048
2Dec 6, 2023 02:247,34582,469,52655,966,0004,997,0002,330,624
3Dec 6, 2023 02:247,354121,374,48861,039,87502,203,648
4Dec 6, 2023 02:247,36087,670,96853,073,0008,011,0002,412,544
5Dec 6, 2023 02:247,37089,327,11658,164,0003,008,0002,457,600
6Dec 6, 2023 02:247,384121,131,13161,283,43202,203,648
7Dec 6, 2023 02:247,386129,696,01261,301,14402,203,648
8Dec 6, 2023 02:247,41489,699,51459,522,0002,017,0002,469,888
9Dec 6, 2023 02:247,45088,093,16353,854,0007,978,0002,277,376
10Dec 6, 2023 02:247,45191,728,30058,849,0002,992,0002,342,912
11Dec 6, 2023 02:247,49087,988,20859,161,0003,008,0002,494,464
12Dec 6, 2023 02:247,49488,471,13860,192,0002,006,0002,408,448