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 listOct 6, 2025 17:32wnwnScore: 78,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2025 17:3278,034669,325,421645,682,0001,999,0002,277,376
2Oct 6, 2025 17:3278,114674,187,675648,347,00002,289,664
3Oct 6, 2025 17:3278,158672,868,426646,709,0001,999,0002,260,992