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 31, 2023 13:01Ignas BagdonasIgnas BagdonasScore: 16,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2023 13:0116,790162,897,129138,355,0001,002,0002,273,280
2Aug 31, 2023 13:0116,792162,521,644138,373,0001,002,0002,273,280
3Aug 31, 2023 13:0116,792165,987,089137,372,0002,005,0002,273,280
4Aug 31, 2023 13:0116,799162,768,690135,416,0004,012,0002,273,280
5Aug 31, 2023 13:0116,877162,676,362137,081,0003,001,0002,379,776
6Aug 31, 2023 13:0116,880165,445,797138,106,0002,001,0002,273,280
7Aug 31, 2023 13:0116,922172,040,045139,449,0001,003,0002,273,280
8Aug 31, 2023 13:0116,950165,439,169139,692,000997,0002,273,280
9Aug 31, 2023 13:0116,960168,009,708139,766,000998,0002,273,280
10Aug 31, 2023 13:0117,950214,446,816148,987,77902,289,664
11Aug 31, 2023 13:0118,335207,450,565152,177,70302,293,760
12Aug 31, 2023 13:0118,337211,149,383152,196,18202,289,664