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 11:49Kevin HeaveyKevin HeaveyScore: 56,520Success
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 11:4956,485535,332,688468,824,80402,240,512
2Jan 17, 2023 11:5056,500526,004,188468,948,57802,211,840
3Jan 17, 2023 11:5056,505546,811,928468,991,38002,220,032
4Jan 17, 2023 11:4956,520547,559,350469,113,75902,228,224
5Jan 17, 2023 11:4956,528544,536,530469,185,83802,228,224
6Jan 17, 2023 11:5056,552537,424,191469,379,86002,228,224