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 6, 2024 18:17bruHFTbruHFTScore: 394,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 18:17393,1753,286,805,8553,207,381,00055,971,0002,289,664
2Nov 6, 2024 18:17393,5433,289,125,5883,208,434,00057,971,0002,289,664
3Nov 6, 2024 18:17393,9553,298,512,1113,206,871,00062,958,0002,285,568
4Nov 6, 2024 18:17394,2923,297,115,0433,192,659,00079,966,0002,293,760
5Nov 6, 2024 18:17394,4893,305,696,7433,198,300,00075,959,0002,289,664
6Nov 6, 2024 18:17396,4053,323,571,6613,226,197,00063,964,0002,293,760
7Nov 6, 2024 18:17398,4683,339,782,1223,233,327,00073,961,0002,293,760
8Nov 6, 2024 18:17399,6303,349,259,7213,264,964,00051,967,0002,289,664
9Nov 6, 2024 18:17399,7463,352,201,7783,272,919,00044,971,0002,293,760