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 18:51Ian MckibbenIan MckibbenScore: 43,065Success
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 18:5143,007382,114,668354,962,0001,999,0002,506,752
2Jan 11, 2025 18:5143,023386,175,984355,089,0002,000,0002,506,752
3Jan 11, 2025 18:5143,026378,228,102355,113,0002,000,0002,510,848
4Jan 11, 2025 18:5143,053383,706,152356,339,0001,000,0002,510,848
5Jan 11, 2025 18:5143,065386,174,310356,437,0001,001,0002,502,656
6Jan 11, 2025 18:5143,087388,818,624355,627,0001,997,0002,289,664
7Jan 11, 2025 18:5143,088387,031,869356,630,000998,0002,510,848
8Jan 11, 2025 18:5143,094383,327,833355,682,0001,998,0002,289,664
9Jan 11, 2025 18:5143,094387,871,669356,682,000999,0002,289,664