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 11, 2024 00:22Bubble BoiBubble BoiScore: 54,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2024 00:2254,707526,274,658454,069,70402,240,512
2Feb 11, 2024 00:2254,798515,254,227454,824,48002,232,320
3Feb 11, 2024 00:2254,811521,839,426454,932,03802,236,416