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 18:57Bubble BoiBubble BoiScore: 57,963Success
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 18:5757,717541,614,233479,054,43102,244,608
2Feb 2, 2024 18:5757,743545,706,111479,268,45502,244,608
3Feb 2, 2024 18:5757,944550,741,812480,933,51102,232,320
4Feb 2, 2024 18:5757,963533,628,792481,091,71402,236,416
5Feb 2, 2024 18:5757,982545,540,592481,252,36002,240,512
6Feb 2, 2024 18:5758,027542,249,646481,626,62202,248,704