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 07:38Yuriy LyfenkoYuriy LyfenkoScore: 11,580Success
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 07:3811,371120,415,76293,375,0001,004,0002,289,664
2Jan 10, 2022 07:3811,371119,740,74793,376,0001,004,0002,289,664
3Jan 10, 2022 07:3811,376115,408,35593,420,0001,004,0002,396,160
4Jan 10, 2022 07:3811,381118,988,34293,459,0001,004,0002,289,664
5Jan 10, 2022 07:3811,394120,744,16793,563,0001,006,0002,289,664
6Jan 10, 2022 07:3811,397118,638,54093,585,0001,006,0002,273,280
7Jan 10, 2022 07:3811,580121,980,05694,116,0002,002,0002,289,664
8Jan 10, 2022 07:3811,582118,929,81395,127,0001,001,0002,269,184
9Jan 10, 2022 07:3811,582116,887,58894,130,0002,002,0002,371,584
10Jan 10, 2022 07:3812,005179,625,93299,644,78502,265,088
11Jan 10, 2022 07:3812,008162,105,03099,668,85202,269,184
12Jan 10, 2022 07:3812,010183,564,93199,683,65502,277,376