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 29, 2022 02:52apuxbtapuxbtScore: 103,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2022 02:52103,223928,910,309856,748,67602,297,856
2Nov 29, 2022 02:52103,306926,520,133857,438,22302,293,760
3Nov 29, 2022 02:52103,464930,915,946858,750,02902,277,376