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 listJul 9, 2023 22:24sliceteamsliceteamScore: 12,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 22:2412,209129,101,708100,329,0001,003,0002,383,872
2Jul 9, 2023 22:2412,218124,335,788101,409,00002,383,872
3Jul 9, 2023 22:2412,219123,042,782100,414,0001,004,0002,260,992
4Jul 9, 2023 22:2412,219123,777,655100,412,0001,004,0002,383,872
5Jul 9, 2023 22:2412,220126,671,445101,425,00002,260,992
6Jul 9, 2023 22:2412,220122,956,283101,424,00002,502,656
7Jul 9, 2023 22:2412,223124,051,269100,444,0001,004,0002,396,160
8Jul 9, 2023 22:2412,226126,591,742101,477,00002,523,136
9Jul 9, 2023 22:2412,226121,984,270100,474,0001,004,0002,260,992
10Jul 9, 2023 22:2412,753178,547,366105,848,95602,269,184
11Jul 9, 2023 22:2412,774172,250,525106,024,70902,260,992
12Jul 9, 2023 22:2412,777165,666,010106,051,12002,265,088