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 17:21Ian MckibbenIan MckibbenScore: 90,461Success
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 17:2290,424777,924,026748,522,0001,998,0002,383,872
2Jan 11, 2025 17:2290,425778,721,231748,529,0001,998,0002,289,664
3Jan 11, 2025 17:2290,451777,122,003747,744,0002,998,0002,289,664
4Jan 11, 2025 17:2190,461783,204,755748,831,0001,999,0002,289,664
5Jan 11, 2025 17:2190,466779,275,848748,872,0001,999,0002,277,376
6Jan 11, 2025 17:2190,468774,098,181748,889,0001,999,0002,289,664