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 24, 2021 19:12Roman LytkinRoman LytkinScore: 373,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2021 19:12372,1313,147,760,0863,088,688,53402,236,416
2Nov 24, 2021 19:12373,1073,153,106,3553,096,784,41702,269,184
3Nov 24, 2021 19:12376,5103,182,598,0423,125,032,77602,265,088