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 4, 2021 10:31Sergey SamokhvalovSergey SamokhvalovScore: 19,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2021 10:3119,817187,091,671163,483,0001,002,0002,519,040
2Jul 4, 2021 10:3119,820185,880,396163,499,0001,003,0002,383,872
3Jul 4, 2021 10:3119,823197,611,531164,530,00002,383,872
4Jul 4, 2021 10:3119,825187,919,791163,547,0001,003,0002,387,968
5Jul 4, 2021 10:3119,826189,243,104163,555,0001,003,0002,375,680
6Jul 4, 2021 10:3119,827194,901,936164,561,00002,379,776
7Jul 4, 2021 10:3119,836197,807,315163,644,000997,0002,383,872
8Jul 4, 2021 10:3119,850190,985,516162,755,0001,997,0002,514,944
9Jul 4, 2021 10:3119,853190,438,365162,784,0001,997,0002,514,944
10Jul 4, 2021 10:3120,331222,346,420168,743,95102,252,800
11Jul 4, 2021 10:3120,335210,355,616168,783,82202,228,224
12Jul 4, 2021 10:3120,349214,286,592168,897,64502,220,032