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 listJan 10, 2022 06:11Yuriy LyfenkoYuriy LyfenkoScore: 13,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 06:1113,131132,861,412106,986,0001,999,0002,281,472
2Jan 10, 2022 06:1113,134132,868,167107,015,0002,000,0002,289,664
3Jan 10, 2022 06:1113,138131,747,782107,045,0002,000,0002,289,664
4Jan 10, 2022 06:1113,141131,888,704107,072,0002,001,0002,281,472
5Jan 10, 2022 06:1113,143130,389,173107,083,0002,001,0002,289,664
6Jan 10, 2022 06:1113,163132,586,591107,249,0002,004,0002,289,664
7Jan 10, 2022 06:1113,174132,076,314108,344,0001,003,0002,265,088
8Jan 10, 2022 06:1113,177134,632,945108,369,0001,003,0002,277,376
9Jan 10, 2022 06:1113,253138,154,560109,000,0001,000,0002,289,664
10Jan 10, 2022 06:1113,565170,834,995112,590,49602,273,280
11Jan 10, 2022 06:1113,770176,164,331114,294,92702,269,184
12Jan 10, 2022 06:1113,787174,858,333114,432,40202,285,568