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 listSep 21, 2025 07:58sheryllynn24sheryllynn24Score: 8,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 07:588,05194,116,79864,829,0001,994,0002,289,664
2Sep 21, 2025 07:588,09392,104,85365,166,0002,005,0002,383,872
3Sep 21, 2025 07:588,15495,809,80267,678,00002,289,664
4Sep 21, 2025 07:588,53398,563,58968,830,0001,995,0002,289,664
5Sep 21, 2025 07:588,538101,189,79768,868,0001,996,0002,289,664
6Sep 21, 2025 07:588,54997,138,50769,960,000999,0002,289,664
7Sep 21, 2025 07:588,554101,242,64869,000,0002,000,0002,514,944
8Sep 21, 2025 07:588,55999,747,34070,043,0001,000,0002,289,664
9Sep 21, 2025 07:588,58598,178,68069,249,0002,007,0002,289,664
10Sep 21, 2025 07:588,58799,728,95269,266,0002,007,0002,523,136
11Sep 21, 2025 07:588,59399,570,21069,310,0002,008,0002,523,136
12Sep 21, 2025 07:588,81399,237,65270,140,0003,006,0002,289,664