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 16, 2023 23:29Kevin HeaveyKevin HeaveyScore: 171,389Success
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 00:10171,2941,485,593,9061,421,739,52402,236,416
2Jan 17, 2023 00:10171,3361,488,698,9531,422,088,79702,220,032
3Jan 17, 2023 00:12171,3371,480,766,7721,422,099,53102,232,320
4Jan 17, 2023 00:10171,3561,490,727,3311,422,258,70302,236,416
5Jan 17, 2023 00:12171,3891,487,950,8351,422,532,65202,224,128
6Jan 17, 2023 00:12171,4091,505,436,0851,422,697,55402,232,320
7Jan 16, 2023 23:29171,4111,492,830,0411,422,715,26402,224,128
8Jan 16, 2023 23:29171,4131,496,617,8431,422,727,04402,211,840
9Jan 16, 2023 23:29171,4981,513,853,9441,423,435,96302,220,032