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 28, 2021 20:54Yuriy LyfenkoYuriy LyfenkoScore: 31,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2021 20:5431,562299,760,359261,961,16902,277,376
2May 28, 2021 20:5431,640307,711,886262,611,76602,273,280
3May 28, 2021 20:5431,657299,733,790262,754,40002,277,376
4May 28, 2021 20:5431,672326,089,631262,881,16902,269,184
5May 28, 2021 20:5431,679307,678,522262,935,28602,281,472
6May 28, 2021 20:5431,702352,861,598263,129,21002,273,280