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 listFeb 23, 2025 15:45AndrewAndrewScore: 65,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 15:4565,446562,993,363542,201,0001,000,0002,277,376
2Feb 23, 2025 15:4565,448568,667,239542,219,0001,000,0002,265,088
3Feb 23, 2025 15:4565,491567,110,716541,575,0001,998,0002,265,088