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 13, 2024 15:23Bubble BoiBubble BoiScore: 56,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2024 15:2356,487529,591,698468,838,78802,248,704
2Feb 13, 2024 15:2356,531524,152,871469,210,23302,236,416
3Feb 13, 2024 15:2356,588540,833,600469,680,11902,232,320