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 listJul 25, 2024 11:25matsuoka-601matsuoka-601Score: 21,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2024 11:2521,530255,647,994178,700,89702,285,568
2Jul 25, 2024 11:2521,550245,519,272178,861,58102,289,664
3Jul 25, 2024 11:2521,581206,204,651177,124,0002,001,0002,285,568
4Jul 25, 2024 11:2521,584207,102,789177,143,0002,001,0002,285,568
5Jul 25, 2024 11:2521,592207,175,922178,215,0001,001,0002,285,568
6Jul 25, 2024 11:2521,596201,605,571177,244,0002,002,0002,265,088
7Jul 25, 2024 11:2521,610201,629,292179,364,00002,269,184
8Jul 25, 2024 11:2521,613201,609,893178,388,0001,002,0002,285,568
9Jul 25, 2024 11:2521,632205,293,404177,552,0001,994,0002,519,040
10Jul 25, 2024 11:2521,635211,126,179178,569,0001,003,0002,285,568
11Jul 25, 2024 11:2521,637204,779,843178,587,0001,003,0002,527,232
12Jul 25, 2024 11:2522,095247,773,857183,385,99302,297,856