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 18, 2025 19:37Ian MckibbenIan MckibbenScore: 50,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 19:3750,213438,958,000414,771,0001,998,0002,523,136
2Jan 18, 2025 19:3750,230439,782,076415,910,000999,0002,289,664
3Jan 18, 2025 19:3750,651451,340,990419,402,0001,000,0002,289,664