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 listMar 9, 2025 19:46Aniruddha DebAniruddha DebScore: 5,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2025 19:595,80170,044,06346,145,0002,006,0002,449,408
2Mar 9, 2025 19:465,83174,684,23943,356,0005,041,0002,330,624
3Mar 9, 2025 20:005,83575,579,96343,385,0005,044,0002,420,736
4Mar 9, 2025 19:465,88074,565,34444,822,0003,984,0002,416,640
5Mar 9, 2025 19:595,90069,651,32742,978,0005,996,0002,416,640
6Mar 9, 2025 19:525,90475,944,46342,000,0007,000,0002,490,368
7Mar 9, 2025 19:465,93270,660,87543,208,0006,029,0002,535,424
8Mar 9, 2025 20:005,96369,897,34444,444,0005,050,0002,482,176
9Mar 9, 2025 19:595,97671,725,43543,530,0006,073,0002,510,848
10Mar 9, 2025 20:006,09976,960,40947,588,0003,037,0002,265,088
11Mar 9, 2025 19:526,32579,368,33646,444,0006,057,0002,424,832
12Mar 9, 2025 19:527,46086,288,46055,926,0005,992,0002,449,408