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 13, 2025 04:50Ian MckibbenIan MckibbenScore: 63,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 04:5062,210545,072,336514,340,0002,001,0002,277,376
2Jan 13, 2025 04:5063,278552,113,535524,209,0001,000,0002,277,376
3Jan 13, 2025 04:5063,341551,521,065524,733,000999,0002,289,664