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:54apuxbtapuxbtScore: 103,616Success
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:54103,494924,132,360859,004,19602,277,376
2Nov 29, 2022 02:54103,616917,507,370860,015,63102,293,760
3Nov 29, 2022 02:54104,117934,200,949864,171,31602,301,952