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 22, 2026 13:34SneedSneedScore: 80,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 13:3480,915696,294,312591,642,00079,951,0002,273,280
2Feb 22, 2026 13:3480,935691,587,797588,789,00082,970,0002,269,184
3Feb 22, 2026 13:3481,038699,311,011609,655,00062,964,0002,281,472