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 16:30Bubble BoiBubble BoiScore: 456,903Success
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 16:30452,1743,815,767,2703,753,043,49002,236,416
2Feb 2, 2024 16:30456,9033,849,514,6253,792,295,83102,240,512
3Feb 2, 2024 16:30461,0373,889,952,8713,826,610,95602,240,512