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 listAug 26, 2025 22:15Adam FolwarcznyAdam FolwarcznyScore: 166,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 22:14166,6981,404,062,7431,382,598,000999,0002,506,752
2Aug 26, 2025 22:14166,7071,403,973,4761,382,666,000999,0002,531,328
3Aug 26, 2025 22:15166,7101,403,288,7381,383,696,00002,531,328
4Aug 26, 2025 22:14166,7121,409,138,6801,383,711,00002,506,752
5Aug 26, 2025 22:14166,7461,410,280,5681,383,990,00002,506,752
6Aug 26, 2025 22:14166,7531,406,015,2531,382,051,0001,998,0002,531,328
7Aug 26, 2025 22:15166,7561,409,644,8401,383,079,000999,0002,531,328
8Aug 26, 2025 22:14166,7581,408,795,4641,383,096,000999,0002,269,184
9Aug 26, 2025 22:15166,7661,408,353,7241,383,158,000999,0002,498,560