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 31, 2022 16:01Yuriy LyfenkoYuriy LyfenkoScore: 7,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2022 16:017,550119,417,18062,661,37802,207,744
2Jul 31, 2022 16:017,602145,514,66963,100,45102,199,552
3Jul 31, 2022 16:017,610138,086,10563,164,18502,301,952
4Jul 31, 2022 16:027,619132,728,83963,236,06502,220,032
5Jul 31, 2022 16:027,620130,108,25163,242,04702,277,376
6Jul 31, 2022 16:027,627126,834,87163,303,05302,293,760
7Jul 31, 2022 16:017,635124,041,46963,372,20502,224,128
8Jul 31, 2022 16:017,654140,406,20663,530,31802,183,168
9Jul 31, 2022 16:017,657138,007,41763,556,20502,224,128