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:23Bubble BoiBubble BoiScore: 452,589Success
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:23452,2913,838,639,0283,754,016,12502,232,320
2Feb 2, 2024 16:23452,5893,815,055,3403,756,484,60902,248,704
3Feb 2, 2024 16:23459,2863,874,038,9223,812,070,01402,248,704