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 11, 2023 19:23Kevin HeaveyKevin HeaveyScore: 52,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2023 19:2252,900515,865,662439,073,32202,228,224
2Jan 11, 2023 19:2352,909516,745,647439,145,70302,228,224
3Jan 11, 2023 19:2252,910508,078,648439,151,21802,224,128
4Jan 11, 2023 19:2352,913510,601,271439,173,96802,236,416
5Jan 11, 2023 19:2352,933504,658,222439,341,26202,306,048
6Jan 11, 2023 19:2252,936516,504,695439,367,74702,232,320