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 listJan 17, 2023 19:29Kevin HeaveyKevin HeaveyScore: 62,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2023 19:2962,579586,019,966519,402,11202,228,224
2Jan 17, 2023 19:5062,590590,239,694519,497,73402,228,224
3Jan 17, 2023 19:3062,591582,930,407519,508,22102,232,320
4Jan 17, 2023 19:3062,597581,003,476519,552,17602,228,224
5Jan 17, 2023 19:5062,599600,807,826519,569,24302,228,224
6Jan 17, 2023 19:2962,600589,439,397519,577,15102,228,224
7Jan 17, 2023 19:2962,613582,155,964519,686,48202,236,416
8Jan 17, 2023 19:5062,614584,971,063519,697,11902,232,320
9Jan 17, 2023 19:3062,619591,665,739519,734,62702,220,032