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 listAug 2, 2026 17:43George SeabridgeGeorge SeabridgeScore: 6,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:446,66065,978,72253,035,0002,244,0002,113,536
2Aug 2, 2026 17:446,71266,294,18353,476,0002,236,0002,113,536
3Aug 2, 2026 17:446,74365,861,27553,685,0002,286,0002,113,536
4Aug 2, 2026 17:446,75165,908,19253,805,0002,231,0002,113,536
5Aug 2, 2026 17:446,77966,196,98954,046,0002,222,0002,113,536
6Aug 2, 2026 17:446,87967,049,91554,870,0002,227,0002,113,536
7Aug 2, 2026 17:447,27570,303,84258,153,0002,235,0002,113,536
8Aug 2, 2026 17:447,44173,702,95659,520,0002,241,0002,113,536
9Aug 2, 2026 17:447,48872,864,55359,920,0002,235,0002,113,536