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 16, 2022 09:08Andrey TsvetkovAndrey TsvetkovScore: 32,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 09:3732,646334,920,000270,963,83702,215,936
2Jan 16, 2022 09:0832,657332,642,978271,053,71502,224,128
3Jan 16, 2022 09:3732,661333,414,497271,083,12802,224,128
4Jan 16, 2022 09:3732,661345,485,213271,086,61302,228,224
5Jan 16, 2022 09:0832,668344,218,275271,140,51602,215,936
6Jan 16, 2022 09:0832,672336,116,238271,174,67702,220,032