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 listNov 18, 2024 23:36zielajzielajScore: 3,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 23:363,52548,828,30228,246,0001,008,0002,367,488
2Nov 18, 2024 23:363,59860,635,56427,870,0001,990,0002,523,136
3Nov 18, 2024 23:363,61956,169,04429,033,0001,001,0002,523,136
4Nov 18, 2024 23:363,71759,234,18228,858,0001,990,0002,531,328
5Nov 18, 2024 23:363,72354,839,91429,908,000996,0002,383,872
6Nov 18, 2024 23:363,77455,094,58431,323,00002,269,184