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 26, 2024 21:30alxalxScore: 1,598,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2024 21:301,598,13913,331,384,05913,264,551,53402,265,088
2Jul 26, 2024 21:301,598,68213,330,074,87913,269,062,04602,252,800
3Jul 26, 2024 21:301,619,75313,505,726,49413,443,952,57402,244,608