- Added solutions by Ulrich Rieke.

33 files changed, 334 insertions, 38 deletions

diff --git a/challenge-339/ulrich-rieke/cpp/ch-1.cpp b/challenge-339/ulrich-rieke/cpp/ch-1.cpp
new file mode 100755
index 0000000000..1d69b69150
--- /dev/null
+++ b/challenge-339/ulrich-rieke/cpp/ch-1.cpp
@@ -0,0 +1,56 @@
+#include <vector>

+#include <iostream>

+#include <sstream>

+#include <string>

+#include <algorithm>

+#include <cstdlib>

+

+std::vector<std::string> split( const std::string & text , char delimiter ) {

+   std::vector<std::string> tokens ;

+   std::istringstream istr { text } ;

+   std::string word ;

+   while ( std::getline( istr , word , delimiter ) ) 

+      tokens.push_back( word ) ;

+   return tokens ;

+}

+

+int main( ) {

+   std::cout << "Enter at least 4 integers separated by blanks!\n" ;

+   std::string line ;

+   std::getline( std::cin , line ) ;

+   auto tokens { split( line , ' ' ) } ;

+   std::vector<int> numbers ;

+   for ( auto s : tokens ) 

+      numbers.push_back( std::stoi( s ) ) ;

+   int len = numbers.size( ) ;

+   //if all numbers are positive or 0 or all are negative , we sort in 

+   //ascending order. In the first case, we subtract the product of the 

+   //two greatest numbers from the product of the 2 smallest. In the other

+   //case , vice versa.

+   //if the numbers are both positive and negative , we sort in ascending

+   //order of absolute values

+   bool allPositive = std::all_of( numbers.begin( ) , numbers.end( ) , []( int

+	    d ) {return d >= 0 ; } ) ;

+   bool allNegative = std::all_of ( numbers.begin( ) , numbers.end( ) , [](

+	    int d ) { return d < 0 ; } ) ;

+   if ( allPositive || allNegative ) {

+      std::sort( numbers.begin( ) , numbers.end( )) ;

+      if ( allPositive ) {

+	 std::cout << ( numbers[len - 2] * numbers[len - 1] - numbers[0] * 

+	       numbers[1] ) << '\n' ;

+      }

+      if ( allNegative ) {

+	 std::cout << ( numbers[0] * numbers[1] - numbers[len - 2] * numbers[len

+	       - 1] ) << '\n' ;

+      }

+   }

+   else {

+      std::sort( numbers.begin( ) , numbers.end( ) , [](int a , int b) {

+	    return std::abs( a ) < std::abs( b ) ; } ) ;

+      std::cout << ( numbers[0] * numbers[1] - numbers[len - 2] * numbers[len 

+	    - 1]) << '\n' ;

+   }

+   return 0 ;

+}

+

+

diff --git a/challenge-339/ulrich-rieke/cpp/ch-2.cpp b/challenge-339/ulrich-rieke/cpp/ch-2.cpp
new file mode 100755
index 0000000000..45bf047704
--- /dev/null
+++ b/challenge-339/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,35 @@
+#include <vector>

+#include <iostream>

+#include <sstream>

+#include <algorithm>

+#include <string>

+

+std::vector<std::string> split( const std::string & text , char delimiter ) {

+   std::vector<std::string> tokens ;

+   std::string word ;

+   std::istringstream istr { text } ;

+   while ( std::getline( istr , word , delimiter ) ) 

+      tokens.push_back( word ) ;

+   return tokens ;

+}

+

+int main( ) {

+   std::cout << "Enter some height differences separated by blanks!\n" ;

+   std::string line ;

+   std::getline( std::cin , line ) ;

+   auto tokens { split( line , ' ' ) } ;

+   std::vector<int> differences , heights ;

+   for ( auto s : tokens ) {

+      differences.push_back( std::stoi( s ) ) ;

+   }

+   heights.push_back( 0 ) ;

+   int currentHeight = 0 ;

+   for ( auto it = differences.begin( ) ; it != differences.end( ) ; ++it ) {

+      currentHeight += *it ;

+      heights.push_back( currentHeight ) ;

+   }

+   std::cout << *std::max_element( heights.begin( ) , heights.end( ) ) << 

+      '\n' ;

+   return 0 ;

+}

+      

diff --git a/challenge-339/ulrich-rieke/haskell/ch-1.hs b/challenge-339/ulrich-rieke/haskell/ch-1.hs
new file mode 100755
index 0000000000..c5c4f66447
--- /dev/null
+++ b/challenge-339/ulrich-rieke/haskell/ch-1.hs
@@ -0,0 +1,32 @@
+module Challenge339

+   where

+import Data.List ( sort , sortBy , (!!)) 

+

+allPositive :: [Int] -> Bool

+allPositive = all ((>=0) )

+

+allNegative :: [Int] -> Bool

+allNegative = all ((< 0) )

+

+solution :: [Int] -> Int  

+solution list 

+   |allPositive list = (sorted !! ( l - 2 ) * sorted !! ( l - 1 )) - ( sorted !!

+	               0 * sorted !! 1 )

+   |allNegative list = ( sorted !! 0 * sorted !! 1 ) - ( sorted !! ( l - 2 ) * 

+	               sorted !! (l - 1) )

+   |otherwise        = (alterSorted !! 0 * alterSorted !! 1) - ( alterSorted !! 

+	               ( l - 2 ) * alterSorted !! ( l - 1 ))

+    where

+     sorted :: [Int]

+     sorted = sort list

+     alterSorted :: [Int]

+     alterSorted = sortBy(\a b -> compare ( abs a ) (abs b ) ) list

+     l :: Int

+     l = length list

+

+main :: IO ( )

+main = do

+   putStrLn "Enter at least 4 integers separated by blanks!"

+   numberline <- getLine

+   print $ solution $ map read $ words numberline

+     

diff --git a/challenge-339/ulrich-rieke/haskell/ch-2.hs b/challenge-339/ulrich-rieke/haskell/ch-2.hs
new file mode 100755
index 0000000000..72e0ebe85f
--- /dev/null
+++ b/challenge-339/ulrich-rieke/haskell/ch-2.hs
@@ -0,0 +1,11 @@
+module Challenge339_2 

+   where

+

+solution :: [Int] -> Int

+solution list = maximum ( scanl ( + ) 0 list ++ [0] )

+

+main :: IO ( )

+main = do

+   putStrLn "Enter some height differences separated by blanks!"

+   numberline <- getLine

+   print $ solution $ map read $ words numberline

diff --git a/challenge-339/ulrich-rieke/perl/ch-1.pl b/challenge-339/ulrich-rieke/perl/ch-1.pl
new file mode 100755
index 0000000000..d1391510d9
--- /dev/null
+++ b/challenge-339/ulrich-rieke/perl/ch-1.pl
@@ -0,0 +1,38 @@
+#!/usr/bin/perl ;

+use strict ;

+use warnings ;

+use feature 'say' ;

+use POSIX ;

+

+say "Enter at least 4 integers separated by blanks!" ;

+my $line = <STDIN> ;

+chomp $line ;

+my @numbers = split( /\s+/ , $line ) ;

+my $len = scalar( @numbers ) ;

+my $allPositive = 0 ;

+my $allNegative = 0 ;

+if (scalar( grep { $_ >= 0 } @numbers ) == $len ) {

+   $allPositive = 1 ;

+}

+if ( scalar( grep { $_ < 0 } @numbers ) == $len ) {

+   $allNegative = 1 ;

+}

+if ( $allPositive || $allNegative ) {

+   my @sorted = sort { $a <=> $b } @numbers ;

+   if ( $allPositive ) {

+      my $result = $sorted[$len - 2] * $sorted[$len - 1] - $sorted[0] * 

+	    $sorted[1]  ;

+      say $result ;

+   }

+   if ( $allNegative ) {

+      my $result = $sorted[0] * $sorted[1] - $sorted[$len - 2] * $sorted[$len

+	    - 1]  ;

+      say $result ;

+   }

+}

+else {

+   my @sorted = sort { abs( $a ) <=> abs( $b ) } @numbers ;

+   my $result = $sorted[0] * $sorted[1] - $sorted[$len - 2] * 

+         $sorted[$len - 1]  ;

+   say $result ;

+}

diff --git a/challenge-339/ulrich-rieke/perl/ch-2.pl b/challenge-339/ulrich-rieke/perl/ch-2.pl
new file mode 100755
index 0000000000..87f84a3a55
--- /dev/null
+++ b/challenge-339/ulrich-rieke/perl/ch-2.pl
@@ -0,0 +1,17 @@
+#!/usr/bin/perl ;

+use strict ;

+use warnings ;

+use feature 'say' ;

+use List::Util qw ( max ) ;

+

+say "Enter some height differences as integers separated by whitespace!" ;

+my $line = <STDIN> ;

+chomp $line ;

+my @numbers = split( /\s+/ , $line ) ;

+my $currentHeight = 0 ;

+my @heights = (0) ;

+for my $n ( @numbers ) {

+   $currentHeight += $n ;

+   push( @heights , $currentHeight ) ;

+}

+say max( @heights ) ;

diff --git a/challenge-339/ulrich-rieke/raku/ch-1.raku b/challenge-339/ulrich-rieke/raku/ch-1.raku
new file mode 100755
index 0000000000..918db5501d
--- /dev/null
+++ b/challenge-339/ulrich-rieke/raku/ch-1.raku
@@ -0,0 +1,29 @@
+use v6 ;

+

+say "Enter more than 4 integers separated by blanks!" ;

+my $line = $*IN.get ;

+my @numbers = $line.words.map( {.Int} ) ;

+my $len = @numbers.elems ;

+#if all numbers are greater than or equal to 0 or all are smaller than 0 ,

+#we sort the array in ascending order. In the first of the above cases, we

+#subtract the product of the last 2 numbers from that of the first 2 , 

+#otherwise the other way round. If numbers are both negative and positive , 

+#we sort in ascending order of absolute values 

+my $all_positive = @numbers.grep( {$_ >= 0} ).elems == $len  ;

+my $all_negative =  @numbers.grep( {$_ < 0} ).elems == $len ; 

+if ( $all_positive || $all_negative ) {

+   @numbers .= sort ;

+   if ( $all_positive ) {

+      say (@numbers[$len - 2] * @numbers[$len - 1] - @numbers[0] * 

+	 @numbers[1] ) ;

+   }

+   if ( $all_negative ) {

+      say ( @numbers[0] * @numbers[1] - @numbers[$len - 2] * @numbers[$len 

+	    - 1] ) ;

+   }

+}

+else {

+   @numbers .= sort( {$^a.abs <=> $^b.abs} ) ;

+   say ( @numbers[0] * @numbers[1] - @numbers[$len - 2] * @numbers[$len - 1] )

+      ;

+}

diff --git a/challenge-339/ulrich-rieke/raku/ch-2.raku b/challenge-339/ulrich-rieke/raku/ch-2.raku
new file mode 100755
index 0000000000..77997c3c3f
--- /dev/null
+++ b/challenge-339/ulrich-rieke/raku/ch-2.raku
@@ -0,0 +1,12 @@
+use v6 ;

+

+say "Please enter some height differences as integers separated by blanks!" ;

+my $line = $*IN.get ;

+my @numbers = $line.words.map( {.Int} ) ;

+my @heights = (0) ;

+my $currentHeight = 0 ;

+for @numbers -> $n {

+   $currentHeight += $n ;

+   @heights.push( $currentHeight ) ;

+}

+say @heights.max ;

diff --git a/challenge-339/ulrich-rieke/rust/ch-1.rs b/challenge-339/ulrich-rieke/rust/ch-1.rs
new file mode 100755
index 0000000000..d1e9e33ad0
--- /dev/null
+++ b/challenge-339/ulrich-rieke/rust/ch-1.rs
@@ -0,0 +1,31 @@
+use std::io ;
+
+fn main() {
+    println!("Enter an array of integers with 4 or more numbers!");
+    let mut inline : String = String::new( ) ;
+    io::stdin( ).read_line( &mut inline ).unwrap( ) ;
+    let mut numbers : Vec<i32> = inline.trim( ).split_whitespace( ).map( 
+	  |s| s.parse::<i32>( ).unwrap( ) ).collect( ) ;
+    let len : usize = numbers.len( ) ;
+    //if all numbers are greater than 0 or smaller than 0 we sort 
+    //depending on the case we form pairs of the smallest or the greatest
+    //of these sorted numbers and subtract
+    let all_positive : bool = numbers.iter( ).all( |d| *d >= 0 ) ;
+    let all_negative : bool = numbers.iter( ).all( |d| *d < 0 ) ;
+    if all_positive || all_negative {
+       numbers.sort( ) ;
+       if all_positive {
+	  println!("{}" , numbers[len - 2] * numbers[len - 1] - 
+		numbers[0] * numbers[1] ) ;
+       }
+       if all_negative {
+	  println!("{}" , numbers[0] * numbers[1] - numbers[len - 2] * 
+		numbers[len - 1] ) ;
+       }
+    }
+    else { //different signs!
+       numbers.sort_by_key( |d| d.abs( ) ) ;
+       println!("{}" , numbers[0] * numbers[1] - numbers[len - 2] *
+	     numbers[len - 1] ) ;
+    }
+}
diff --git a/challenge-339/ulrich-rieke/rust/ch-2.rs b/challenge-339/ulrich-rieke/rust/ch-2.rs
new file mode 100755
index 0000000000..9b414b0a56
--- /dev/null
+++ b/challenge-339/ulrich-rieke/rust/ch-2.rs
@@ -0,0 +1,16 @@
+use std::io ;
+
+fn main() {
+    println!("Please enter some integers as a sequence height differences!");
+    let mut inline : String = String::new( ) ;
+    io::stdin( ).read_line( &mut inline ).unwrap( ) ;
+    let differences : Vec<i32>= inline.trim( ).split_whitespace( ).map( |s|
+	  s.parse::<i32>( ).unwrap( ) ).collect( ) ;
+    let mut heights : Vec<i32> = vec![0] ;
+    let mut currentheight : i32 = 0 ;
+    for d in &differences {
+       currentheight += *d ;
+       heights.push( currentheight ) ;
+    }
+    println!("{}" , heights.into_iter( ).max( ).unwrap( ) ) ;
+}
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index 982ff805f4..9dbb5ad55a 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -43,6 +43,20 @@
             ],
             "id" : "Simon Proctor",
             "name" : "Simon Proctor"
+         },
+         {
+            "data" : [
+               [
+                  "Perl",
+                  2
+               ],
+               [
+                  "Raku",
+                  2
+               ]
+            ],
+            "id" : "Ulrich Rieke",
+            "name" : "Ulrich Rieke"
          }
       ]
    },
@@ -81,13 +95,18 @@
                "drilldown" : "Simon Proctor",
                "name" : "Simon Proctor",
                "y" : 2
+            },
+            {
+               "drilldown" : "Ulrich Rieke",
+               "name" : "Ulrich Rieke",
+               "y" : 4
             }
          ],
          "name" : "The Weekly Challenge - 339"
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 4] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 5] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge - 339"
diff --git a/stats/pwc-language-breakdown-2019.json b/stats/pwc-language-breakdown-2019.json
index ecc011186c..8416a0d9c6 100644
--- a/stats/pwc-language-breakdown-2019.json
+++ b/stats/pwc-language-breakdown-2019.json
@@ -970,7 +970,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Language"
diff --git a/stats/pwc-language-breakdown-2020.json b/stats/pwc-language-breakdown-2020.json
index ab335ae81e..f28802ecb4 100644
--- a/stats/pwc-language-breakdown-2020.json
+++ b/stats/pwc-language-breakdown-2020.json
@@ -1223,7 +1223,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Language"
diff --git a/stats/pwc-language-breakdown-2021.json b/stats/pwc-language-breakdown-2021.json
index b7d4c3b78a..dfcff0f82e 100644
--- a/stats/pwc-language-breakdown-2021.json
+++ b/stats/pwc-language-breakdown-2021.json
@@ -1223,7 +1223,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Language"
diff --git a/stats/pwc-language-breakdown-2022.json b/stats/pwc-language-breakdown-2022.json
index 18c3534a4d..4608f8823f 100644
--- a/stats/pwc-language-breakdown-2022.json
+++ b/stats/pwc-language-breakdown-2022.json
@@ -1223,7 +1223,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Language"
diff --git a/stats/pwc-language-breakdown-2023.json b/stats/pwc-language-breakdown-2023.json
index 6301cba94e..7b2ba07e7e 100644
--- a/stats/pwc-language-breakdown-2023.json
+++ b/stats/pwc-language-breakdown-2023.json
@@ -1200,7 +1200,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Language"
diff --git a/stats/pwc-language-breakdown-2024.json b/stats/pwc-language-breakdown-2024.json
index f15ae167d8..ab8c345711 100644
--- a/stats/pwc-language-breakdown-2024.json
+++ b/stats/pwc-language-breakdown-2024.json
@@ -1246,7 +1246,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Language"
diff --git a/stats/pwc-language-breakdown-2025.json b/stats/pwc-language-breakdown-2025.json
index d4bb0e4b27..0fb548af79 100644
--- a/stats/pwc-language-breakdown-2025.json
+++ b/stats/pwc-language-breakdown-2025.json
@@ -8,11 +8,11 @@
             "data" : [
                [
                   "Perl",
-                  3
+                  5
                ],
                [
                   "Raku",
-                  4
+                  6
                ],
                [
                   "Blog",
@@ -691,7 +691,7 @@
             {
                "drilldown" : "339",
                "name" : "339",
-               "y" : 7
+               "y" : 11
             },
             {
                "drilldown" : "338",
@@ -878,7 +878,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Language"
diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json
index 49a7d80831..b3b379aa97 100644
--- a/stats/pwc-language-breakdown-summary.json
+++ b/stats/pwc-language-breakdown-summary.json
@@ -10,11 +10,11 @@
          "data" : [
             [
                "Perl",
-               17436
+               17438
             ],
             [
                "Raku",
-               9696
+               9698
             ],
             [
                "Blog",
@@ -37,7 +37,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge Contributions [2019 - 2025]"
diff --git a/stats/pwc-leaders.json b/stats/pwc-leaders.json
index 186d6fe0b0..cf73616364 100644
--- a/stats/pwc-leaders.json
+++ b/stats/pwc-leaders.json
@@ -112,11 +112,11 @@
             "data" : [
                [
                   "Perl",
-                  514
+                  516
                ],
                [
                   "Raku",
-                  522
+                  524
                ]
             ],
             "id" : "Ulrich Rieke",
@@ -827,7 +827,7 @@
             {
                "drilldown" : "Ulrich Rieke",
                "name" : "7: Ulrich Rieke",
-               "y" : 2072
+               "y" : 2080
             },
             {
                "drilldown" : "Flavio Poletti",
@@ -1049,7 +1049,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "Click the columns to drilldown the score breakdown. Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "Click the columns to drilldown the score breakdown. Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "Team Leaders (TOP 50)"
diff --git a/stats/pwc-summary-1-30.json b/stats/pwc-summary-1-30.json
index d693243cc3..e7a174e210 100644
--- a/stats/pwc-summary-1-30.json
+++ b/stats/pwc-summary-1-30.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-121-150.json b/stats/pwc-summary-121-150.json
index 4d5dfa2259..b5b9e01eb3 100644
--- a/stats/pwc-summary-121-150.json
+++ b/stats/pwc-summary-121-150.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-151-180.json b/stats/pwc-summary-151-180.json
index 105b2b46dc..b43db302e5 100644
--- a/stats/pwc-summary-151-180.json
+++ b/stats/pwc-summary-151-180.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-181-210.json b/stats/pwc-summary-181-210.json
index 3aa388836d..71b90de85c 100644
--- a/stats/pwc-summary-181-210.json
+++ b/stats/pwc-summary-181-210.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-211-240.json b/stats/pwc-summary-211-240.json
index 3bee2d151c..b0eae9a756 100644
--- a/stats/pwc-summary-211-240.json
+++ b/stats/pwc-summary-211-240.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-241-270.json b/stats/pwc-summary-241-270.json
index bcbcfbc141..934035a903 100644
--- a/stats/pwc-summary-241-270.json
+++ b/stats/pwc-summary-241-270.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-271-300.json b/stats/pwc-summary-271-300.json
index b9b9f9f639..5abad7858a 100644
--- a/stats/pwc-summary-271-300.json
+++ b/stats/pwc-summary-271-300.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-301-330.json b/stats/pwc-summary-301-330.json
index 71709c66f9..664244f2eb 100644
--- a/stats/pwc-summary-301-330.json
+++ b/stats/pwc-summary-301-330.json
@@ -21,7 +21,7 @@
             0,
             2,
             4,
-            514,
+            516,
             24,
             18,
             16,
@@ -54,7 +54,7 @@
             2,
             0,
             0,
-            522,
+            524,
             0,
             0,
             2,
@@ -109,7 +109,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 28] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 28] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-31-60.json b/stats/pwc-summary-31-60.json
index 2977918c63..c427f07223 100644
--- a/stats/pwc-summary-31-60.json
+++ b/stats/pwc-summary-31-60.json
@@ -115,7 +115,7 @@
       }
    ],
    "subtitle" : {
-      "text" : "[Champions: 30] Last updated at 2025-09-15 09:03:42 GMT"
+      "text" : "[Champions: 30] Last updated at 2025-09-15 10:18:43 GMT"
    },
    "title" : {
       "text" : "The Weekly Challenge [2019 - 2025]"
diff --git a/stats/pwc-summary-61-90.json b/stats/pwc-summary-61-90.json
index e22816a9f4..731fcf6d8a 100644
--- a/stats/pwc-summary-61-90.json
+++ b/