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:30Adam FolwarcznyAdam FolwarcznyScore: 10,011Success
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:309,784113,554,49744,567,00036,644,0002,285,568
2Aug 30, 2025 21:309,901112,182,86249,505,00032,673,0002,310,144
3Aug 30, 2025 21:309,964109,462,19949,819,00032,880,0002,355,200
4Aug 30, 2025 21:309,972108,947,66950,251,00032,515,0002,351,104
5Aug 30, 2025 21:3010,005113,541,11451,407,00031,635,0002,523,136
6Aug 30, 2025 21:3010,008108,729,59551,424,00031,645,0002,523,136
7Aug 30, 2025 21:3010,011112,704,07853,417,00029,676,0002,523,136
8Aug 30, 2025 21:3010,017109,633,68650,476,00032,661,0002,269,184
9Aug 30, 2025 21:3010,058108,273,52650,089,00033,392,0002,449,408
10Aug 30, 2025 21:3010,076113,474,48751,164,00032,469,0002,523,136
11Aug 30, 2025 21:3010,090113,984,74452,220,00031,529,0002,519,040
12Aug 30, 2025 21:3010,228110,128,42847,382,00037,511,0002,523,136