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 18, 2023 23:28Kevin HeaveyKevin HeaveyScore: 65,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2023 23:2765,905617,561,111547,010,06302,228,224
2Jan 18, 2023 23:2765,915608,352,382547,098,08102,224,128
3Jan 18, 2023 23:2865,918614,216,780547,118,21102,232,320
4Jan 18, 2023 23:2865,919618,245,539547,126,60102,228,224
5Jan 18, 2023 23:2865,938613,976,282547,285,85702,228,224
6Jan 18, 2023 23:2765,968616,059,797547,538,38102,224,128