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 07:56Ahmed MhedhbiAhmed MhedhbiScore: 55,563Success
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 07:5655,538486,095,296458,968,0001,999,0002,273,280
2Aug 18, 2025 07:5655,558484,099,382460,131,0001,000,0002,273,280
3Aug 18, 2025 07:5655,560486,928,476460,151,0001,000,0002,400,256
4Aug 18, 2025 07:5655,562481,892,082461,165,00002,273,280
5Aug 18, 2025 07:5655,563483,411,137460,172,0001,000,0002,396,160
6Aug 18, 2025 07:5655,563484,496,694461,176,00002,273,280
7Aug 18, 2025 07:5655,569487,312,436460,226,0001,000,0002,273,280
8Aug 18, 2025 07:5655,574484,199,852460,263,0001,000,0002,273,280
9Aug 18, 2025 07:5655,582486,378,992460,328,0001,000,0002,273,280