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 listJun 4, 2024 06:14GraceGraceScore: 5,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2024 06:145,12971,456,71741,560,0001,013,0002,400,256
2Jun 4, 2024 06:145,14268,231,84341,659,0001,016,0002,396,160
3Jun 4, 2024 06:145,14368,416,79441,667,0001,016,0002,273,280
4Jun 4, 2024 06:145,16165,678,72740,848,0001,992,0002,400,256
5Jun 4, 2024 06:145,16765,426,50240,891,0001,994,0002,273,280
6Jun 4, 2024 06:145,16865,300,87340,903,0001,995,0002,273,280
7Jun 4, 2024 06:145,16969,412,76940,908,0001,995,0002,400,256
8Jun 4, 2024 06:145,17866,075,09040,981,0001,999,0002,273,280
9Jun 4, 2024 06:145,18467,160,22842,026,0001,000,0002,400,256
10Jun 4, 2024 06:145,370105,479,50744,569,47902,285,568
11Jun 4, 2024 06:145,383107,077,98044,678,25002,285,568
12Jun 4, 2024 06:145,383112,714,35844,678,61702,285,568