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 listSep 8, 2023 14:15Kevin HeaveyKevin HeaveyScore: 53,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2023 14:1553,739510,762,977446,035,76802,224,128
2Sep 8, 2023 14:1553,817518,935,399446,682,09102,228,224
3Sep 8, 2023 14:1553,881535,253,765447,213,19902,228,224
4Sep 8, 2023 14:1553,955511,838,133447,829,42902,211,840
5Sep 8, 2023 14:1554,008511,912,695448,263,87402,228,224
6Sep 8, 2023 14:1554,020513,935,762448,365,51902,224,128