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 16, 2026 18:47wnwnScore: 8,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:478,72394,267,35569,383,0003,016,0002,404,352
2Feb 16, 2026 18:478,74097,414,98769,524,0003,022,0002,428,928
3Feb 16, 2026 18:478,97596,401,87670,464,0004,026,0002,441,216