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:38NoSIMD_C#NoSIMD_C#Score: 83,728Success
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:3883,647719,953,367637,250,00057,022,0002,404,352
2Nov 6, 2024 15:3883,677723,385,169631,560,00062,956,0002,293,760
3Nov 6, 2024 15:3883,685719,446,632629,534,00065,055,0002,306,048
4Nov 6, 2024 15:3883,709720,688,909640,805,00053,983,0002,289,664
5Nov 6, 2024 15:3883,728724,059,303632,948,00061,994,0002,314,240
6Nov 6, 2024 15:3883,739721,660,382633,028,00062,002,0002,297,856
7Nov 6, 2024 15:3883,745717,462,869639,074,00056,006,0002,289,664
8Nov 6, 2024 15:3883,747724,317,292637,089,00058,008,0002,551,808
9Nov 6, 2024 15:3883,752716,867,630635,132,00060,012,0002,293,760