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 07:04Ian MckibbenIan MckibbenScore: 44,075Success
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 07:0444,055396,160,143363,661,0001,998,0002,293,760
2Jan 11, 2025 07:0444,060392,612,514363,704,0001,998,0002,293,760
3Jan 11, 2025 07:0444,065391,193,584363,742,0001,998,0002,293,760
4Jan 11, 2025 07:0444,067392,348,058363,754,0001,998,0002,277,376
5Jan 11, 2025 07:0444,075393,100,908364,823,000999,0002,273,280
6Jan 11, 2025 07:0444,093392,234,472363,975,0001,999,0002,293,760
7Jan 11, 2025 07:0444,094387,196,582363,978,0001,999,0002,293,760
8Jan 11, 2025 07:0444,095387,214,280363,991,0001,999,0002,293,760
9Jan 11, 2025 07:0444,096392,104,919363,997,0001,999,0002,277,376