diff --git a/code_to_optimize/code_directories/simple_tracer_e2e/workload.py b/code_to_optimize/code_directories/simple_tracer_e2e/workload.py
index 2333fa990..f130ccecf 100644
--- a/code_to_optimize/code_directories/simple_tracer_e2e/workload.py
+++ b/code_to_optimize/code_directories/simple_tracer_e2e/workload.py
@@ -3,14 +3,13 @@
 
 def funcA(number):
     number = min(1000, number)
-    k = 0
-    for i in range(number * 100):
-        k += i
-    # Simplify the for loop by using sum with a range object
-    j = sum(range(number))
+    # Use arithmetic progression sum formula instead of looping
+    k = (number * 100 - 1) * (number * 100) // 2
+    # Use arithmetic progression sum formula for sum(range(number))
+    j = (number - 1) * number // 2
 
-    # Use a generator expression directly in join for more efficiency
-    return " ".join(str(i) for i in range(number))
+    # Use list comprehension as it's slightly faster in CPython here
+    return " ".join([str(i) for i in range(number)])
 
 
 def test_threadpool() -> None:
@@ -28,10 +27,8 @@ def __init__(self, num_classes=1000):
         self.features_size = 256 * 6 * 6
 
     def forward(self, x):
-        features = self._extract_features(x)
-
-        output = self._classify(features)
-        return output
+        # _extract_features always returns empty list, so result is empty list.
+        return []
 
     def _extract_features(self, x):
         # Return empty list immediately; no need to iterate over x