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 listJan 16, 2022 21:14Yuriy LyfenkoYuriy LyfenkoScore: 31,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 21:1631,192316,791,602258,896,69502,220,032
2Jan 16, 2022 21:1431,195323,096,645258,919,12302,220,032
3Jan 16, 2022 21:1631,195328,705,820258,920,25302,220,032
4Jan 16, 2022 21:1431,198317,845,953258,941,26302,215,936
5Jan 16, 2022 21:1431,212319,652,065259,057,02502,220,032
6Jan 16, 2022 21:1631,212320,703,010259,062,80602,224,128