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 15, 2022 16:58Yuriy LyfenkoYuriy LyfenkoScore: 11,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 16:5811,781119,431,90295,790,0001,995,0002,285,568
2Jul 15, 2022 16:5811,786123,572,54095,831,0001,996,0002,269,184
3Jul 15, 2022 16:5811,787120,537,95495,838,0001,996,0002,277,376
4Jul 15, 2022 16:5811,793118,815,62095,889,0001,997,0002,371,584
5Jul 15, 2022 16:5811,800121,824,57695,939,0001,998,0002,371,584
6Jul 15, 2022 16:5811,800128,360,81895,942,0001,998,0002,277,376
7Jul 15, 2022 16:5811,801126,504,23995,948,0001,998,0002,285,568
8Jul 15, 2022 16:5811,803120,140,10795,969,0001,999,0002,277,376
9Jul 15, 2022 16:5811,803119,920,13795,970,0001,999,0002,285,568
10Jul 15, 2022 16:5811,936163,074,34399,072,44402,273,280
11Jul 15, 2022 16:5812,271161,773,272101,852,71302,281,472
12Jul 15, 2022 16:5812,274166,536,774101,870,38802,277,376