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 listJun 7, 2024 15:46GraceGraceScore: 75,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 15:4673,467663,368,279609,775,91402,232,320
2Jun 7, 2024 15:4673,686685,571,593611,594,96702,236,416
3Jun 7, 2024 15:4673,740677,789,024612,045,51602,240,512
4Jun 7, 2024 15:4674,038682,891,464614,513,92302,236,416
5Jun 7, 2024 15:4574,704679,711,483620,046,86402,367,488
6Jun 7, 2024 15:4574,833673,381,221621,112,55002,248,704
7Jun 7, 2024 15:4575,021691,670,559622,675,57102,232,320
8Jun 7, 2024 15:4575,297680,540,190624,968,00602,240,512
9Jun 7, 2024 15:4675,494696,774,074626,599,68702,236,416
10Jun 7, 2024 15:4575,819685,916,973629,295,17702,236,416
11Jun 7, 2024 15:4575,997698,323,740630,771,76102,240,512
12Jun 7, 2024 15:4676,942705,904,079638,616,16902,244,608