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 21, 2025 17:14Ian MckibbenIan MckibbenScore: 49,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 17:1449,188436,323,958408,257,00002,424,832
2Jan 21, 2025 17:1449,192435,267,495406,301,0001,996,0002,531,328
3Jan 21, 2025 17:1449,196434,426,794407,330,0001,000,0002,510,848
4Jan 21, 2025 17:1449,224429,354,326408,556,00002,441,216
5Jan 21, 2025 17:1449,229436,553,292407,599,000999,0002,269,184
6Jan 21, 2025 17:1449,234430,226,809406,642,0001,998,0002,269,184