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 12:36NoSIMD_C#NoSIMD_C#Score: 111,686Success
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 12:36111,121948,162,162800,395,000121,907,0002,293,760
2Nov 6, 2024 12:36111,503951,005,020792,548,000132,924,0002,551,808
3Nov 6, 2024 12:36111,632956,309,378805,606,000120,940,0002,293,760
4Nov 6, 2024 12:36111,650950,727,976793,739,000132,956,0002,297,856
5Nov 6, 2024 12:36111,686950,735,115793,992,000132,998,0002,306,048
6Nov 6, 2024 12:36111,704959,334,434797,124,000130,020,0002,310,144
7Nov 6, 2024 12:36111,716959,366,321792,210,000135,035,0002,527,232
8Nov 6, 2024 12:36111,836961,014,748809,210,000119,030,0002,293,760
9Nov 6, 2024 12:36112,220964,193,372794,514,000136,916,0002,293,760