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 5, 2021 16:27Yuriy LyfenkoYuriy LyfenkoScore: 36,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2021 16:2736,593367,011,009303,723,95102,220,032
2Jul 5, 2021 16:2736,605369,649,590303,818,68602,224,128
3Jul 5, 2021 16:2736,622362,540,735303,962,43402,215,936