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 11, 2024 12:58ivanivanScore: 85,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 12:5884,609734,894,444474,497,000227,758,0002,465,792
2Nov 11, 2024 12:5884,695726,222,514473,979,000228,990,0002,289,664
3Nov 11, 2024 12:5884,794725,953,730473,858,000229,931,0002,502,656
4Nov 11, 2024 12:5884,994733,080,391473,629,000231,818,0002,461,696
5Nov 11, 2024 12:5885,142729,191,907474,782,000231,893,0002,289,664
6Nov 11, 2024 12:5885,151732,769,262473,835,000232,919,0002,400,256
7Nov 11, 2024 12:5885,268732,679,843474,813,000232,908,0002,465,792
8Nov 11, 2024 12:5885,273732,218,761474,846,000232,924,0002,289,664
9Nov 11, 2024 12:5885,525733,205,219473,907,000235,954,0002,457,600