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 30, 2022 15:42Yuriy LyfenkoYuriy LyfenkoScore: 9,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 15:429,628106,730,51177,912,0001,997,0002,461,696
2Jul 30, 2022 15:429,663102,738,91977,194,0003,007,0002,392,064
3Jul 30, 2022 15:429,664108,724,65577,205,0003,008,0002,322,432
4Jul 30, 2022 15:429,684105,298,40873,344,0007,032,0002,285,568
5Jul 30, 2022 15:429,709110,600,68277,564,0003,021,0002,510,848
6Jul 30, 2022 15:429,780103,137,65879,166,0002,004,0002,453,504
7Jul 30, 2022 15:429,857112,362,35679,816,0001,995,0002,482,176
8Jul 30, 2022 15:4210,019146,327,35183,157,31602,285,568
9Jul 30, 2022 15:4210,035149,779,23383,287,99602,248,704
10Jul 30, 2022 15:4210,080144,260,75283,661,18402,179,072
11Jul 30, 2022 15:4210,506114,488,65381,188,0006,013,0002,433,024
12Jul 30, 2022 15:4212,085126,132,57398,299,0002,006,0002,457,600