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 listApr 6, 2024 22:39aspiringquantaspiringquantScore: 1,646,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2024 22:391,646,15713,727,736,72113,663,105,39602,256,896
2Apr 6, 2024 22:391,646,62513,729,001,53913,666,990,20002,256,896
3Apr 6, 2024 22:391,647,45913,740,554,90813,673,907,01302,265,088