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 listApr 28, 2024 15:25Steve HanSteve HanScore: 20,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 15:2520,261221,390,163168,163,49902,297,856
2Apr 28, 2024 15:2520,285243,206,677168,366,50702,297,856
3Apr 28, 2024 15:2520,296224,716,062168,453,26202,301,952
4Apr 28, 2024 15:2620,345233,330,922168,866,54802,179,072
5Apr 28, 2024 15:2620,348239,645,185168,891,64702,293,760
6Apr 28, 2024 15:2620,428229,283,357169,548,43602,297,856
7Apr 28, 2024 15:2520,449225,597,129169,723,55302,301,952
8Apr 28, 2024 15:2520,459228,468,304169,812,66602,306,048
9Apr 28, 2024 15:2520,607233,153,901171,039,10202,301,952