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 15, 2024 11:39ndbnndbnScore: 32,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 11:3932,503294,283,750267,780,0001,998,0002,482,176
2Nov 15, 2024 11:3932,506292,136,741267,802,0001,998,0002,478,080
3Nov 15, 2024 11:3932,507299,783,175267,809,0001,998,0002,535,424
4Nov 15, 2024 11:3932,508293,465,811267,818,0001,998,0002,535,424
5Nov 15, 2024 11:3932,522289,380,212267,935,0001,999,0002,535,424
6Nov 15, 2024 11:3932,527294,702,680267,979,0001,999,0002,535,424
7Nov 15, 2024 11:3932,531293,080,752268,007,0002,000,0002,535,424
8Nov 15, 2024 11:3932,536295,164,673268,048,0002,000,0002,535,424
9Nov 15, 2024 11:3932,536295,128,299269,047,0001,000,0002,535,424