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 listJul 11, 2023 05:35Giga BowserGiga BowserScore: 62,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2023 05:3562,772572,587,037521,006,11402,269,184
2Jul 11, 2023 05:3562,779576,694,883521,063,54802,265,088
3Jul 11, 2023 05:3562,837582,726,615521,546,64902,277,376