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: 20,264Success
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:3120,250193,897,102167,072,0001,000,0002,514,944
2Jul 4, 2021 10:3120,252193,732,769166,088,0002,001,0002,519,040
3Jul 4, 2021 10:3120,252192,293,754166,090,0002,001,0002,514,944
4Jul 4, 2021 10:3120,257195,298,813167,131,0001,000,0002,478,080
5Jul 4, 2021 10:3120,260192,934,911166,160,0002,001,0002,490,368
6Jul 4, 2021 10:3120,263196,535,435166,178,0002,002,0002,387,968
7Jul 4, 2021 10:3120,264192,792,694166,191,0002,002,0002,371,584
8Jul 4, 2021 10:3120,266194,737,087166,207,0002,002,0002,383,872
9Jul 4, 2021 10:3120,267194,842,106167,214,0001,001,0002,375,680
10Jul 4, 2021 10:3120,489210,481,774170,057,11302,260,992
11Jul 4, 2021 10:3120,491210,703,085170,071,76402,260,992
12Jul 4, 2021 10:3120,783228,426,650172,496,05202,260,992