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 30, 2022 15:39Yuriy LyfenkoYuriy LyfenkoScore: 9,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 15:399,583102,165,18676,519,0003,020,0002,297,856
2Jul 30, 2022 15:399,682103,106,68277,351,0003,013,0002,396,160
3Jul 30, 2022 15:399,699102,871,43678,486,0002,012,0002,301,952
4Jul 30, 2022 15:399,743103,593,36277,875,0002,995,0002,461,696
5Jul 30, 2022 15:399,783105,662,04677,187,0004,009,0002,449,408
6Jul 30, 2022 15:399,793107,829,03677,265,0004,013,0002,506,752
7Jul 30, 2022 15:399,889105,150,05979,079,0003,003,0002,359,296
8Jul 30, 2022 15:399,993108,606,31479,948,0002,998,0002,490,368
9Jul 30, 2022 15:399,997149,363,06182,971,79302,224,128
10Jul 30, 2022 15:3910,168147,074,63984,392,52602,215,936
11Jul 30, 2022 15:3911,160120,314,09787,596,0005,034,0002,457,600
12Jul 30, 2022 15:3913,117169,886,633108,866,99702,244,608