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 listJun 30, 2021 20:24Yuriy LyfenkoYuriy LyfenkoScore: 40,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 20:2440,376638,258,372335,119,29502,240,512
2Jun 30, 2021 20:2440,388647,675,268335,217,76502,244,608
3Jun 30, 2021 20:2440,392646,066,759335,256,94302,244,608