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 12, 2023 12:10Kevin HeaveyKevin HeaveyScore: 56,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2023 12:1256,405534,382,117468,164,43702,224,128
2Jan 12, 2023 12:1256,423528,995,990468,314,53102,232,320
3Jan 12, 2023 12:1056,446528,370,077468,504,05402,224,128
4Jan 12, 2023 12:1256,461535,964,912468,623,53302,228,224
5Jan 12, 2023 12:1056,479524,531,069468,774,71102,220,032
6Jan 12, 2023 12:1056,481533,411,265468,788,54202,240,512