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 16, 2025 17:29art-intart-intScore: 372,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 17:29370,8403,106,276,1862,964,082,000113,887,0002,351,104
2Jan 16, 2025 17:29371,1133,112,887,7572,974,366,000105,870,0002,514,944
3Jan 16, 2025 17:29371,4453,112,211,0212,981,093,000101,900,0002,351,104
4Jan 16, 2025 17:29371,6673,115,569,4942,954,972,000129,866,0002,351,104
5Jan 16, 2025 17:29372,9873,125,720,6762,997,858,00097,930,0002,351,104
6Jan 16, 2025 17:29373,3543,126,408,9042,992,910,000105,926,0002,351,104
7Jan 16, 2025 17:29373,5143,129,814,3552,982,274,000117,892,0002,510,848
8Jan 16, 2025 17:29373,7113,127,278,6062,982,883,000118,915,0002,510,848
9Jan 16, 2025 17:29377,3713,164,955,7173,026,272,000105,904,0002,351,104