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 18, 2025 06:55Ashish AhujaAshish AhujaScore: 11,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 06:5511,212115,895,01286,054,0007,004,0002,490,368
2Aug 18, 2025 06:5511,219116,620,96386,110,0007,008,0002,371,584
3Aug 18, 2025 06:5511,269116,635,33187,562,0005,970,0002,535,424
4Aug 18, 2025 06:5511,319117,400,71886,954,0006,996,0002,535,424
5Aug 18, 2025 06:5511,331120,928,26188,048,0006,003,0002,355,200
6Aug 18, 2025 06:5511,397118,849,89187,629,0006,970,0002,285,568
7Aug 18, 2025 06:5511,466119,270,73092,166,0003,005,0002,285,568
8Aug 18, 2025 06:5511,529126,637,14588,715,0006,977,0002,277,376
9Aug 18, 2025 06:5511,869122,740,82090,549,0007,960,0002,387,968