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 16, 2022 05:50Yuriy LyfenkoYuriy LyfenkoScore: 11,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2022 05:5011,958122,141,44397,249,0002,005,0002,269,184
2Jul 16, 2022 05:5011,964124,724,33197,295,0002,006,0002,285,568
3Jul 16, 2022 05:5011,969126,552,39098,340,0001,003,0002,285,568
4Jul 16, 2022 05:5011,970127,612,28299,350,00002,285,568
5Jul 16, 2022 05:5011,971124,730,72098,356,0001,003,0002,285,568
6Jul 16, 2022 05:5011,971124,825,11798,353,0001,003,0002,277,376
7Jul 16, 2022 05:5011,972125,627,19997,358,0002,007,0002,277,376
8Jul 16, 2022 05:5011,973123,649,07897,368,0002,007,0002,289,664
9Jul 16, 2022 05:5011,976123,633,13598,393,0001,004,0002,285,568
10Jul 16, 2022 05:5012,308153,971,213102,159,94302,277,376
11Jul 16, 2022 05:5012,319165,111,454102,247,72702,273,280
12Jul 16, 2022 05:5012,319170,315,075102,244,04702,285,568