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 18, 2026 22:03wnwnScore: 5,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:035,77779,280,79646,952,000998,0002,273,280
2Feb 18, 2026 22:035,77970,920,09845,967,0001,998,0002,535,424
3Feb 18, 2026 22:035,78172,082,46845,986,0001,999,0002,535,424