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 5, 2024 09:36kauruuskauruusScore: 61,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 09:3661,911542,749,368511,862,0001,999,0002,314,240
2Nov 5, 2024 09:3661,916544,312,657511,903,0001,999,0002,326,528
3Nov 5, 2024 09:3661,917542,576,744511,913,0001,999,0002,482,176
4Nov 5, 2024 09:3661,927539,495,330510,991,0002,999,0002,326,528
5Nov 5, 2024 09:3661,931542,508,531512,026,0002,000,0002,478,080
6Nov 5, 2024 09:3661,941542,068,792510,114,0004,000,0002,482,176
7Nov 5, 2024 09:3661,942538,145,322512,122,0002,000,0002,478,080
8Nov 5, 2024 09:3661,965536,911,528512,307,0002,001,0002,473,984
9Nov 5, 2024 09:3661,968542,563,114511,339,0002,996,0002,326,528