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:24Bubble BoiBubble BoiScore: 56,534Success
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:2456,521534,067,563469,126,76202,248,704
2Feb 13, 2024 15:2456,534539,080,798469,228,56002,228,224
3Feb 13, 2024 15:2456,541535,179,583469,292,42302,240,512