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 2, 2026 15:20caandocaandoScore: 5,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:205,44669,541,31243,192,0002,008,0002,285,568
2Mar 2, 2026 15:205,46467,008,35043,340,0002,015,0002,285,568
3Mar 2, 2026 15:205,46771,911,73544,370,0001,008,0002,285,568
4Mar 2, 2026 15:205,46873,329,07343,366,0002,017,0002,285,568
5Mar 2, 2026 15:205,47071,159,91844,396,0001,009,0002,523,136
6Mar 2, 2026 15:205,47768,124,35344,451,0001,010,0002,273,280
7Mar 2, 2026 15:205,48068,219,75543,463,0002,021,0002,273,280
8Mar 2, 2026 15:205,48575,238,25944,515,0001,011,0002,285,568
9Mar 2, 2026 15:205,50273,438,99944,654,0001,014,0002,523,136
10Mar 2, 2026 15:205,57268,850,95845,245,0001,005,0002,285,568
11Mar 2, 2026 15:205,58772,403,58645,368,0001,008,0002,285,568
12Mar 2, 2026 15:205,79669,605,74043,096,0005,011,0002,285,568