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 07:01kauruuskauruusScore: 265,279Success
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 07:01265,0722,228,061,8312,101,140,00098,959,0002,326,528
2Nov 5, 2024 07:01265,1552,232,286,1042,106,835,00093,948,0002,326,528
3Nov 5, 2024 07:01265,1792,226,423,6772,121,019,00079,963,0002,326,528
4Nov 5, 2024 07:01265,2702,232,351,7572,116,788,00084,951,0002,330,624
5Nov 5, 2024 07:01265,2792,229,326,2302,089,877,000111,939,0002,326,528
6Nov 5, 2024 07:01265,3202,230,118,8962,122,227,00079,933,0002,486,272
7Nov 5, 2024 07:01265,3502,227,809,7922,101,480,000100,927,0002,330,624
8Nov 5, 2024 07:01265,3642,235,010,6392,120,580,00081,945,0002,326,528
9Nov 5, 2024 07:01266,5872,241,023,5912,135,686,00076,988,0002,330,624