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 22, 2025 06:35Ruoyu QiuRuoyu QiuScore: 62,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 06:2758,841515,557,177486,376,0002,001,0002,265,088
2Aug 22, 2025 06:2758,849518,633,018486,447,0001,997,0002,273,280
3Aug 22, 2025 06:2758,867515,193,260486,596,0001,998,0002,273,280
4Aug 22, 2025 06:3161,995545,057,107512,560,0001,998,0002,273,280
5Aug 22, 2025 06:3162,011539,499,039510,697,0003,997,0002,269,184
6Aug 22, 2025 06:3162,029540,770,137511,838,0002,999,0002,273,280
7Aug 22, 2025 06:3576,055654,663,085630,260,0001,000,0002,531,328
8Aug 22, 2025 06:3576,057658,173,724628,276,0003,001,0002,273,280
9Aug 22, 2025 06:3576,092663,998,088629,567,0001,998,0002,273,280