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 10, 2024 21:42Bubble BoiBubble BoiScore: 56,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2024 21:4255,748526,241,219462,705,95002,236,416
2Feb 10, 2024 21:4256,041533,930,164465,141,77902,256,896
3Feb 10, 2024 21:4256,098529,628,398465,612,43602,240,512