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 4, 2026 15:40caandocaandoScore: 5,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:405,25668,332,11942,610,0001,014,0002,285,568
2Mar 4, 2026 15:405,26468,644,64042,675,0001,016,0002,269,184
3Mar 4, 2026 15:405,27773,967,39641,806,0001,990,0002,285,568
4Mar 4, 2026 15:405,27772,084,51142,803,000995,0002,523,136
5Mar 4, 2026 15:405,27774,613,97442,808,000995,0002,285,568
6Mar 4, 2026 15:405,27869,851,95641,818,0001,991,0002,285,568
7Mar 4, 2026 15:405,28075,487,24341,829,0001,991,0002,285,568
8Mar 4, 2026 15:405,28172,218,54640,846,0002,988,0002,285,568
9Mar 4, 2026 15:405,28374,457,25243,850,00002,523,136
10Mar 4, 2026 15:405,37568,707,26143,597,0001,013,0002,523,136
11Mar 4, 2026 15:405,37873,672,71144,637,00002,285,568
12Mar 4, 2026 15:405,39771,828,67943,804,000995,0002,285,568