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 00:44Yuriy LyfenkoYuriy LyfenkoScore: 13,415Success
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 00:4413,403133,574,113109,244,0002,004,0002,277,376
2Jul 16, 2022 00:4413,404137,949,137109,246,0002,004,0002,285,568
3Jul 16, 2022 00:4413,406137,366,957109,263,0002,004,0002,273,280
4Jul 16, 2022 00:4413,412136,166,640109,317,0002,005,0002,277,376
5Jul 16, 2022 00:4413,414137,748,855110,331,0001,003,0002,285,568
6Jul 16, 2022 00:4413,414134,759,414110,336,0001,003,0002,277,376
7Jul 16, 2022 00:4413,415142,386,591110,340,0001,003,0002,277,376
8Jul 16, 2022 00:4413,419133,264,079109,375,0002,006,0002,285,568
9Jul 16, 2022 00:4413,805147,288,697113,575,0001,005,0002,285,568
10Jul 16, 2022 00:4418,622209,404,253154,559,28902,281,472
11Jul 16, 2022 00:4418,626215,648,391154,596,32402,289,664
12Jul 16, 2022 00:4418,630207,076,133154,628,83402,281,472