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 6, 2025 22:35woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 753,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2025 22:35718,41121,099,443,6922,917,883,0003,044,925,000401,408
2Jan 6, 2025 22:35722,21822,417,146,0932,920,666,0003,073,745,000401,408
3Jan 6, 2025 22:35724,19922,384,893,0012,884,379,0003,126,476,000401,408
4Jan 6, 2025 22:35751,56320,958,891,6593,072,023,0003,165,954,000442,368
5Jan 6, 2025 22:35753,57221,148,399,4512,941,033,0003,313,612,000409,600
6Jan 6, 2025 22:35755,86421,364,458,6813,009,929,0003,263,742,000405,504
7Jan 6, 2025 22:35756,27121,484,360,8312,968,035,0003,309,013,000413,696
8Jan 6, 2025 22:35756,55821,802,664,8513,108,060,0003,171,369,000438,272
9Jan 6, 2025 22:35756,71321,272,700,4662,938,128,0003,342,587,000458,752