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 listMay 11, 2025 18:21vahookvahookScore: 4,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 18:214,89467,607,58938,587,0002,030,0002,273,280
2May 11, 2025 18:214,93462,988,76837,960,0002,996,0002,273,280
3May 11, 2025 18:214,97062,711,81738,236,0003,018,0002,273,280
4May 11, 2025 18:214,99569,470,38637,416,0004,044,0002,273,280
5May 11, 2025 18:215,09267,855,22738,241,0004,025,0002,273,280
6May 11, 2025 18:215,11468,831,67537,397,0005,053,0002,273,280