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 25, 2022 15:28Yuriy LyfenkoYuriy LyfenkoScore: 15,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 15:2814,532192,672,101120,613,29302,195,456
2Jul 25, 2022 15:2814,536187,971,501120,645,50602,211,840
3Jul 25, 2022 15:2814,569185,989,086120,919,78602,248,704
4Jul 25, 2022 15:2815,153157,548,876123,775,0001,996,0002,383,872
5Jul 25, 2022 15:2815,161153,753,471122,839,0002,996,0002,408,448
6Jul 25, 2022 15:2815,169148,462,253124,907,000999,0002,502,656
7Jul 25, 2022 15:2815,185149,615,659124,035,0002,000,0002,375,680
8Jul 25, 2022 15:2815,193153,175,429124,098,0002,001,0002,314,240
9Jul 25, 2022 15:2815,193153,813,185124,102,0002,001,0002,269,184
10Jul 25, 2022 15:2815,194149,004,361123,112,0003,002,0002,379,776
11Jul 25, 2022 15:2815,195148,578,682122,113,0004,003,0002,453,504
12Jul 25, 2022 15:2815,277153,277,793123,800,0002,995,0002,396,160