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 listFeb 4, 2024 03:13Bubble BoiBubble BoiScore: 57,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2024 03:1356,763534,891,729471,136,51702,232,320
2Feb 4, 2024 03:1357,016532,529,778473,231,83602,236,416
3Feb 4, 2024 03:1357,085542,496,194473,807,31102,224,128