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 listJan 13, 2025 06:37Ian MckibbenIan MckibbenScore: 50,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 06:3749,958441,750,031413,649,000999,0002,289,664
2Jan 13, 2025 06:3750,303442,340,238415,517,0001,997,0002,269,184
3Jan 13, 2025 06:3751,812471,524,638428,039,0002,000,0002,269,184