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 1, 2024 17:35Bubble BoiBubble BoiScore: 51,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2024 17:3551,768507,609,304429,678,39002,232,320
2Apr 1, 2024 17:3551,872490,000,621430,540,56702,228,224
3Apr 1, 2024 17:3552,009486,554,733431,675,40402,244,608