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 18, 2025 21:00Adam FolwarcznyAdam FolwarcznyScore: 45,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 21:0145,862406,461,866380,653,00002,519,040
2Aug 18, 2025 21:0145,864406,235,267378,677,0001,998,0002,383,872
3Aug 18, 2025 21:0145,873412,823,017379,748,000999,0002,383,872
4Aug 18, 2025 21:0045,912404,835,877379,070,0002,000,0002,277,376
5Aug 18, 2025 21:0045,987407,670,508379,690,0001,998,0002,285,568
6Aug 18, 2025 21:0045,990405,865,531379,722,0001,998,0002,277,376