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 11, 2025 05:24Ian MckibbenIan MckibbenScore: 114,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 05:24113,618969,515,723756,026,000187,006,0002,293,760
2Jan 11, 2025 05:24114,000976,084,234754,361,000191,837,0002,465,792
3Jan 11, 2025 05:24114,001969,973,560772,356,000173,855,0002,486,272