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 listAug 6, 2025 01:26rockyou1337rockyou1337Score: 2,066,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2025 01:262,065,11017,168,418,89517,070,444,00069,973,0002,260,992
2Aug 6, 2025 01:262,065,40017,179,594,08017,072,858,00069,966,0002,519,040
3Aug 6, 2025 01:262,065,49017,180,164,73317,078,591,00064,975,0002,277,376
4Aug 6, 2025 01:262,065,88717,181,132,01617,084,885,00061,974,0002,277,376
5Aug 6, 2025 01:262,066,16117,178,285,99217,083,170,00065,969,0002,289,664
6Aug 6, 2025 01:262,066,20417,178,862,94817,083,523,00065,971,0002,277,376
7Aug 6, 2025 01:262,066,27817,184,649,29317,068,137,00081,967,0002,285,568
8Aug 6, 2025 01:262,067,53617,196,310,16317,107,575,00052,973,0002,289,664
9Aug 6, 2025 01:262,073,34117,240,579,84617,143,760,00064,968,0002,277,376