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 listJun 21, 2025 15:33Valentin KofmanValentin KofmanScore: 76,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 15:3376,722662,713,508635,796,000999,0002,277,376
2Jun 21, 2025 15:3376,723662,466,576634,801,0001,999,0002,285,568
3Jun 21, 2025 15:3376,772660,910,141636,206,0001,000,0002,285,568