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 12, 2025 22:35Ian MckibbenIan MckibbenScore: 55,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2025 23:0354,537480,524,481450,661,0001,998,0002,289,664
2Jan 12, 2025 23:0354,558485,101,948451,830,000999,0002,527,232
3Jan 12, 2025 22:3554,568477,431,904450,916,0001,999,0002,527,232
4Jan 12, 2025 22:3555,103483,723,340456,351,0001,000,0002,289,664
5Jan 12, 2025 23:0355,109482,151,092456,404,0001,000,0002,285,568
6Jan 12, 2025 22:3555,128487,761,460456,563,000999,0002,531,328