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 16:34Andrey TsvetkovAndrey TsvetkovScore: 75,164Success
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 17:4875,138694,243,592623,641,50402,252,800
2Jan 16, 2022 16:3475,148703,575,477623,730,17902,252,800
3Jan 16, 2022 17:4875,162684,370,711623,841,14202,252,800
4Jan 16, 2022 16:3475,164685,573,967623,858,07202,252,800
5Jan 16, 2022 17:4875,165696,879,128623,865,88802,256,896
6Jan 16, 2022 16:3475,171682,365,326623,918,57002,252,800