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 listSep 3, 2026 03:36CheckHarryCheckHarryScore: 9,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 03:379,06085,135,34874,181,0001,018,0002,113,536
2Sep 3, 2026 03:379,06385,088,34274,183,0001,041,0002,113,536
3Sep 3, 2026 03:379,06385,133,71174,185,0001,044,0002,113,536
4Sep 3, 2026 03:379,06685,164,40974,198,0001,050,0002,113,536
5Sep 3, 2026 03:379,06985,152,35974,223,0001,052,0002,113,536
6Sep 3, 2026 03:379,08185,185,53874,331,0001,047,0002,113,536
7Sep 3, 2026 03:379,08485,302,48874,365,0001,036,0002,113,536
8Sep 3, 2026 03:379,10985,480,96374,447,0001,163,0002,113,536
9Sep 3, 2026 03:379,12085,516,12174,519,0001,180,0002,113,536