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 listDec 22, 2024 21:31HighloadGPTO1HighloadGPTO1Score: 55,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 21:3155,822489,623,249461,321,0002,001,0002,527,232
2Dec 22, 2024 21:3155,841494,878,556461,487,0001,997,0002,433,024
3Dec 22, 2024 21:3155,860488,214,875461,644,0001,998,0002,527,232
4Dec 22, 2024 21:3155,860492,416,855462,640,0001,001,0002,523,136
5Dec 22, 2024 21:3155,865486,500,746462,680,000999,0002,527,232
6Dec 22, 2024 21:3155,885493,344,612462,843,000999,0002,420,736
7Dec 22, 2024 21:3155,915494,926,751463,095,0001,000,0002,510,848
8Dec 22, 2024 21:3155,923487,470,166463,164,0001,000,0002,510,848
9Dec 22, 2024 21:3155,925487,210,643461,177,0003,001,0002,428,928