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:18Ian MckibbenIan MckibbenScore: 56,591Success
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:1951,997460,621,548429,577,0001,998,0002,289,664
2Jan 11, 2025 17:1952,034456,874,238429,887,0001,999,0002,277,376
3Jan 11, 2025 17:1952,043460,095,948429,962,0001,999,0002,523,136
4Jan 11, 2025 17:1656,520492,790,603467,115,0002,000,0002,269,184
5Jan 11, 2025 17:1656,591492,335,068468,704,000999,0002,281,472
6Jan 11, 2025 17:1656,605494,693,148467,821,0001,999,0002,281,472
7Jan 11, 2025 17:1888,872764,677,857736,642,000999,0002,289,664
8Jan 11, 2025 17:1889,061769,313,799737,210,0001,997,0002,289,664
9Jan 11, 2025 17:1891,618789,095,964758,430,0001,998,0002,269,184