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 18:49Bubble BoiBubble BoiScore: 57,869Success
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 18:4957,837541,861,097480,050,64302,240,512
2Feb 2, 2024 18:4957,869541,643,925480,315,43202,232,320
3Feb 2, 2024 18:4958,217558,855,340483,204,64502,236,416