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 2, 2024 17:54Bubble BoiBubble BoiScore: 641,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2024 17:54637,2935,355,842,4525,289,530,23602,252,800
2Feb 2, 2024 17:54641,6465,394,747,5495,325,660,84302,240,512
3Feb 2, 2024 17:54662,4265,556,056,6715,498,139,61402,236,416