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 listAug 30, 2025 21:48Adam FolwarcznyAdam FolwarcznyScore: 8,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 21:488,32296,078,69049,054,00020,022,0002,277,376
2Aug 30, 2025 21:488,36795,126,15050,596,00018,849,0002,396,160
3Aug 30, 2025 21:488,41396,107,21549,878,00019,951,0002,424,832
4Aug 30, 2025 21:488,57093,056,81648,091,00023,043,0002,281,472
5Aug 30, 2025 21:488,60797,005,29050,601,00020,835,0002,367,488
6Aug 30, 2025 21:488,60799,374,59453,582,00017,860,0002,285,568
7Aug 30, 2025 21:488,60893,057,34449,614,00021,830,0002,281,472
8Aug 30, 2025 21:488,63592,970,60748,777,00022,895,0002,293,760
9Aug 30, 2025 21:488,659100,152,69852,904,00018,965,0002,519,040
10Aug 30, 2025 21:488,661100,806,71349,921,00021,965,0002,535,424
11Aug 30, 2025 21:488,671100,789,90349,977,00021,989,0002,510,848
12Aug 30, 2025 21:488,728100,921,00656,568,00015,878,0002,478,080