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 21, 2026 02:08Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:55Tomislav Tunkovic10.23CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:59030,029,968,71330,014,820,0004,011,00016,384Killed by timeout
2Aug 21, 2026 02:093,99843,030,62430,899,0002,287,0002,113,536
3Aug 21, 2026 02:094,02243,289,50131,109,0002,274,0002,113,536
4Aug 21, 2026 02:094,10443,803,78331,793,0002,278,0002,113,536
5Aug 21, 2026 02:094,11643,974,90631,883,0002,282,0002,113,536
6Aug 21, 2026 02:094,16144,348,78732,277,0002,263,0002,113,536
7Aug 21, 2026 02:094,19644,637,37732,517,0002,312,0002,113,536
8Aug 21, 2026 02:094,20044,547,54032,581,0002,284,0002,113,536
9Aug 21, 2026 02:094,20044,690,85132,578,0002,289,0002,113,536
10Aug 21, 2026 02:094,20244,638,13632,583,0002,296,0002,113,536