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 15, 2022 04:11Robert BurkeRobert BurkeScore: 8,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 04:118,23392,382,97868,338,00002,428,928
2Jul 15, 2022 04:118,23593,750,90768,349,00002,277,376
3Jul 15, 2022 04:118,23699,473,64868,356,00002,539,520
4Jul 15, 2022 04:118,23791,045,76368,365,00002,437,120
5Jul 15, 2022 04:118,23790,542,76368,370,00002,277,376
6Jul 15, 2022 04:118,23892,006,94668,373,00002,437,120
7Jul 15, 2022 04:118,24091,107,02567,383,0001,005,0002,514,944
8Jul 15, 2022 04:118,25494,075,91466,525,0001,985,0002,277,376
9Jul 15, 2022 04:118,32990,585,28368,129,0001,001,0002,539,520
10Jul 15, 2022 04:118,934130,829,22974,153,03502,191,360
11Jul 15, 2022 04:118,937132,439,55674,178,68702,179,072
12Jul 15, 2022 04:118,938142,330,06374,182,65902,297,856