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 14, 2024 03:56zielajzielajScore: 5,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 03:564,22062,362,99334,022,0001,000,0002,367,488
2Nov 14, 2024 03:564,23055,397,34734,105,0001,003,0002,523,136
3Nov 14, 2024 03:564,31759,562,80333,845,0001,990,0002,461,696
4Nov 14, 2024 03:565,04666,642,43340,861,0001,021,0002,379,776
5Nov 14, 2024 03:565,07764,294,46341,132,0001,003,0002,265,088
6Nov 14, 2024 03:565,24364,506,79042,528,000989,0002,265,088