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 listNov 30, 2022 19:45Yuriy LyfenkoYuriy LyfenkoScore: 7,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2022 19:457,360130,296,76061,089,20302,183,168
2Nov 30, 2022 19:457,361122,420,11561,097,69702,224,128
3Nov 30, 2022 19:457,494118,949,16262,199,06002,191,360