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 25, 2024 12:21AnSaAnSaScore: 46,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2024 12:2046,455440,095,926385,574,74402,281,472
2Jan 25, 2024 12:2146,467456,797,417385,676,47902,256,896
3Jan 25, 2024 12:2046,471442,827,036385,709,38002,285,568
4Jan 25, 2024 12:2146,472453,610,887385,720,51802,289,664
5Jan 25, 2024 12:2146,476442,772,473385,751,67402,277,376
6Jan 25, 2024 12:2046,555447,325,727386,409,99902,281,472