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 listDec 6, 2023 02:23Yuriy LyfenkoYuriy LyfenkoScore: 7,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 02:237,16986,060,46655,466,0004,033,0002,514,944
2Dec 6, 2023 02:237,22284,592,57555,946,0003,996,0002,301,952
3Dec 6, 2023 02:237,24887,098,41956,148,0004,010,0002,478,080
4Dec 6, 2023 02:237,25987,369,06458,242,0002,008,0002,277,376
5Dec 6, 2023 02:237,26586,163,21755,275,0005,025,0002,359,296
6Dec 6, 2023 02:237,35589,619,22057,041,0004,002,0002,342,912
7Dec 6, 2023 02:237,36384,580,92457,104,0004,007,0002,351,104
8Dec 6, 2023 02:237,37589,072,76557,202,0004,014,0002,502,656
9Dec 6, 2023 02:237,399134,898,75461,411,19902,224,128
10Dec 6, 2023 02:237,40987,947,11059,478,0002,016,0002,396,160
11Dec 6, 2023 02:237,490115,734,32762,164,46202,297,856
12Dec 6, 2023 02:237,498134,537,60262,237,05202,297,856