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 15:36NoSIMD_C#NoSIMD_C#Score: 83,849Success
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 15:3683,776722,789,017651,322,00044,021,0002,297,856
2Nov 6, 2024 15:3683,801725,112,886640,581,00054,964,0002,293,760
3Nov 6, 2024 15:3683,840723,298,045645,884,00049,991,0002,527,232
4Nov 6, 2024 15:3683,841719,484,788644,889,00050,991,0002,539,520
5Nov 6, 2024 15:3683,849723,186,122659,951,00035,997,0002,531,328
6Nov 6, 2024 15:3683,876730,713,369648,159,00048,011,0002,293,760
7Nov 6, 2024 15:3683,905729,026,220661,445,00034,970,0002,297,856
8Nov 6, 2024 15:3683,953726,605,345659,824,00036,990,0002,539,520
9Nov 6, 2024 15:3683,962723,424,071647,896,00048,992,0002,293,760