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 8, 2024 16:39Bubble BoiBubble BoiScore: 57,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2024 16:3957,370547,224,420476,169,94802,220,032
2Feb 8, 2024 16:3957,418542,382,391476,567,68502,232,320
3Feb 8, 2024 16:3957,517545,169,765477,392,83802,228,224