diff options
33 files changed, 431 insertions, 40 deletions
diff --git a/challenge-334/ulrich-rieke/cpp/ch-1.cpp b/challenge-334/ulrich-rieke/cpp/ch-1.cpp new file mode 100755 index 0000000000..93be003b45 --- /dev/null +++ b/challenge-334/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,32 @@ +#include <iostream>
+#include <sstream>
+#include <vector>
+#include <numeric>
+#include <string>
+
+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 some integers separated by blanks!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ auto numarray { split( line , ' ' ) } ;
+ std::vector<int> numbers , indices ;
+ for ( auto s : numarray )
+ numbers.push_back( std::stoi( s ) ) ;
+ std::cout << "Enter some valid indices into the array!\n" ;
+ std::getline( std::cin , line ) ;
+ auto indexes { split( line , ' ' ) } ;
+ for ( auto s : indexes )
+ indices.push_back( std::stoi( s ) ) ;
+ std::cout << std::accumulate( numbers.begin( ) + indices[0] ,
+ numbers.begin( ) + indices[1] + 1 , 0 ) << '\n' ;
+ return 0 ;
+}
diff --git a/challenge-334/ulrich-rieke/cpp/ch-2.cpp b/challenge-334/ulrich-rieke/cpp/ch-2.cpp new file mode 100755 index 0000000000..893ce2dd38 --- /dev/null +++ b/challenge-334/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,85 @@ +#include <iostream>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include <algorithm>
+#include <regex>
+#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 ;
+}
+
+bool isValid( const std::pair<int , int> & point , const std::pair<int ,
+ int> & comparison ) {
+ return point.first == comparison.first || point.second ==
+ comparison.second ;
+}
+
+int manhattan( const std::pair<int , int> & point , const
+ std::pair<int , int> & comparison ) {
+ return std::abs( point.first - comparison.first ) +
+ std::abs( point.second - comparison.second ) ;
+}
+
+int main( ) {
+ std::cout << "Enter two integers separated by blanks!\n" ;
+ std::string line ;
+ std::getline( std::cin, line ) ;
+ auto tokens { split( line , ' ' ) } ;
+ std::cout << "Enter some points ( in brackets ) separated by blanks!\n" ;
+ std::getline( std::cin , line ) ;
+ std::vector<int> numbers ;
+ for ( auto s : tokens )
+ numbers.push_back( std::stoi( s ) ) ;
+ std::pair<int , int> comparison { std::make_pair( numbers[0] ,
+ numbers[1] ) } ;
+ std::string pattern ( "\\d+" ) ;
+ std::regex re { pattern } ;
+ std::vector<int> points ;
+ auto end = std::sregex_token_iterator{} ;
+ for ( auto it = std::sregex_token_iterator{ std::begin( line ) ,
+ std::end( line ) , re } ; it != end ; ++it )
+ points.push_back( std::stoi( *it ) ) ;
+ std::vector<std::pair<int , int>> coordinates ;
+ for ( int i = 0 ; i < points.size( ) - 1 ; i += 2 ) {
+ coordinates.push_back( std::make_pair( points[i] , points[i + 1] ));
+ }
+ std::vector<std::pair<int , std::pair<int , int>>> zipped ;
+ int len = coordinates.size( ) ;
+ for ( int i = 0 ; i < len ; i++ )
+ zipped.push_back( std::make_pair( i , coordinates[i] ) ) ;
+ std::vector<std::pair<int , std::pair<int , int>>> selected ;
+ std::copy_if( zipped.begin( ) , zipped.end( ) ,
+ std::back_inserter( selected) ,
+ [comparison](const auto & p ){ return isValid( p.second ,
+ comparison) ; }) ;
+ int sz = selected.size( ) ;
+ if ( sz == 0 ) {
+ std::cout << -1 ;
+ }
+ if ( sz == 1 ) {
+ std::cout << selected[0].first ;
+ }
+ if ( sz > 1 ) {
+ std::sort( selected.begin( ) , selected.end( ) , [comparison](
+ const auto & p1 , const auto & p2 ) { if ( manhattan(
+ p1.second , comparison ) != manhattan( p2.second ,
+ comparison )) {
+ return manhattan(p1.second , comparison ) < manhattan(
+ p2.second , comparison ) ;
+ }
+ else {
+ return p1.first < p2.first ;
+ } } ) ;
+ std::cout << selected[0].first ;
+ }
+ std::cout << '\n' ;
+ return 0 ;
+}
diff --git a/challenge-334/ulrich-rieke/haskell/ch-1.hs b/challenge-334/ulrich-rieke/haskell/ch-1.hs new file mode 100755 index 0000000000..bb695c01c2 --- /dev/null +++ b/challenge-334/ulrich-rieke/haskell/ch-1.hs @@ -0,0 +1,17 @@ +module Challenge334
+ where
+
+solution :: [Int] -> [Int] -> Int
+solution numbers indices = sum $ take ( to - from + 1 ) $ drop from numbers
+ where
+ to = last indices
+ from = head indices
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some integers separated by blanks!"
+ numberline <- getLine
+ putStrLn "Enter 2 valid indices into this array!"
+ indexLine <- getLine
+ print $ solution ( map read $ words numberline ) ( map read $ words
+ indexLine )
diff --git a/challenge-334/ulrich-rieke/haskell/ch-2.hs b/challenge-334/ulrich-rieke/haskell/ch-2.hs new file mode 100755 index 0000000000..ab27dd18a6 --- /dev/null +++ b/challenge-334/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,45 @@ +module Challenge334_2
+ where
+import Data.List.Split ( chunksOf )
+import Data.Char ( isDigit )
+import Data.List ( sortOn )
+
+parseEntryLine :: String -> [(Int , Int)]
+parseEntryLine line =
+ let parts = words line
+ numbers = map (filter isDigit ) parts
+ relevant = filter ( not . null ) numbers
+ nums = map read relevant
+ coords = chunksOf 2 nums
+ in map (\subli -> (head subli , last subli) ) coords
+
+isValid :: (Int , Int) -> (Int , Int ) -> Bool
+isValid comparison point = or[ fst comparison == fst point ,
+ snd comparison == snd point ]
+
+manhattan :: (Int , Int) -> (Int , Int ) -> Int
+manhattan firstPoint secondPoint = abs( fst firstPoint - fst secondPoint )
+ + abs( snd firstPoint - snd secondPoint )
+
+solution :: [(Int ,(Int , Int))] -> (Int , Int) -> Int
+solution allPoints origin
+ |null valids = -1
+ |length valids == 1 = fst $ head valids
+ |otherwise = fst $ head sorted
+ where
+ valids :: [(Int , (Int , Int))]
+ valids = filter (\p -> isValid origin ( snd p ) ) allPoints
+ sorted :: [(Int , (Int , Int))]
+ sorted = sortOn (\p -> manhattan ( snd p ) origin ) valids
+
+main :: IO ( )
+main = do
+ putStrLn "Enter two integers separated by blanks!"
+ originline <- getLine
+ putStrLn "Enter some points ( in brackets ) , separated by blanks!"
+ pointLine <- getLine
+ let numbers = map read $ words originline
+ coordinates = parseEntryLine pointLine
+ zipped = zip [0 , 1 ..] coordinates
+ origin = (head numbers , last numbers )
+ print $ solution zipped origin
diff --git a/challenge-334/ulrich-rieke/perl/ch-1.pl b/challenge-334/ulrich-rieke/perl/ch-1.pl new file mode 100755 index 0000000000..328688c65a --- /dev/null +++ b/challenge-334/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,15 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use List::Util qw ( sum ) ;
+
+say "Enter some integers separated by spaces!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+say "Enter two valid indices into this array!" ;
+$line = <STDIN> ;
+chomp $line ;
+my @indices = split( /\s+/ , $line ) ;
+say sum( @numbers[$indices[0]..$indices[1]] ) ;
diff --git a/challenge-334/ulrich-rieke/perl/ch-2.pl b/challenge-334/ulrich-rieke/perl/ch-2.pl new file mode 100755 index 0000000000..ec7e8688dc --- /dev/null +++ b/challenge-334/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,56 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use POSIX ;
+use List::Util qw ( zip ) ;
+
+sub manhattan {
+ my $firstpair = shift ;
+ my $secondpair = shift ;
+ return ( abs( $firstpair->[0] - $secondpair->[0] ) +
+ abs( $firstpair->[1] - $secondpair->[1] )) ;
+}
+
+sub isValid {
+ my $pair = shift ;
+ my $comparison = shift ;
+ if ( $pair->[0] == $comparison->[0] || $pair->[1] == $comparison->[1] ) {
+ return 1 ;
+ }
+ else {
+ return 0 ;
+ }
+}
+
+say "Enter 2 integers separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+say "Enter some points in brackets separated by blanks!" ;
+$line = <STDIN> ;
+chomp $line ;
+my @pairs ;
+while ( $line =~ /\[\s*(\d+)\s*\,\s*(\d+)\s*\]/cg ) {
+ push ( @pairs , [$1 , $2] ) ;
+}
+my @zipped = zip [0..scalar( @pairs ) - 1] , \@pairs ;
+my @validPairs = grep { isValid( $_->[1] , \@numbers ) }
+ @zipped ;
+my $len = scalar( @validPairs ) ;
+if ( $len == 0 ) {
+ say -1 ;
+}
+elsif ( $len == 1 ) {
+ say 0 ;
+}
+else {
+ my @distances ;
+ foreach my $zipped( @zipped ) {
+ push( @distances , [$zipped->[0] , manhattan( $zipped->[1] ,
+ \@numbers )] ) ;
+ }
+ my @sorted = sort { $a->[1] <=> $b->[1] || $a->[0] <=> $b->[0] }
+ @distances ;
+ say $sorted[0]->[0] ;
+}
diff --git a/challenge-334/ulrich-rieke/raku/ch-1.raku b/challenge-334/ulrich-rieke/raku/ch-1.raku new file mode 100755 index 0000000000..e7bc351fe3 --- /dev/null +++ b/challenge-334/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,9 @@ +use v6 ;
+
+say "Enter some integers separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+say "Enter two valid indices into this array!" ;
+$line = $*IN.get ;
+my @indices = $line.words.map( {.Int} ) ;
+say [+] @numbers[@indices[0]..@indices[1]]
diff --git a/challenge-334/ulrich-rieke/raku/ch-2.raku b/challenge-334/ulrich-rieke/raku/ch-2.raku new file mode 100755 index 0000000000..4d02742436 --- /dev/null +++ b/challenge-334/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,53 @@ +use v6 ;
+
+sub isValid( $firstpair , $secondpair ) {
+ return $firstpair[0] == $secondpair[0] || $firstpair[1] ==
+ $secondpair[1] ;
+}
+
+sub manhattan( $firstpair , $secondpair ) {
+ return ($firstpair[0] - $secondpair[0]).abs + ( $firstpair[1] -
+ $secondpair[1]).abs ;
+}
+
+say "Enter 2 integers separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+my $origin = [@numbers[0] , @numbers[1]] ;
+say "Enter some points in brackets separated by blanks with commas!" ;
+$line = $*IN.get ;
+my @pairs ;
+my @parts = $line.split( /\] ',' \s+\[/ ) ;
+for @parts -> $pair {
+ if ($pair ~~ /(\d+)\s* ',' \s* (\d+) / ) {
+ my $numberpair = [+$0 , +$1] ;
+ @pairs.push( $numberpair ) ;
+ }
+}
+my @zipped ;
+for (0..@pairs.elems - 1) -> $i {
+ @zipped.push( [ $i , @pairs[$i] ] ) ;
+}
+my @valids ;
+for @zipped -> $pair {
+ if ( isValid( $pair[1] , $origin ) ) {
+ @valids.push( $pair ) ;
+ }
+}
+my $len = @valids.elems ;
+if ( $len == 0 ) {
+ say -1 ;
+}
+elsif ( $len == 1 ) {
+ say @valids[0][0] ;
+}
+else {
+ my @distances ;
+ for @valids -> $part {
+ @distances.push( [$part[0] , manhattan( $part[1] , $origin )] ) ;
+ }
+ my @sorted = @distances.sort( {$^a[1] <=> $^b[1] || $^a[0] <=> $^b[0] } ) ;
+ say @sorted[0][0] ;
+}
+
+
diff --git a/challenge-334/ulrich-rieke/rust/ch-1.rs b/challenge-334/ulrich-rieke/rust/ch-1.rs new file mode 100755 index 0000000000..1b50db92da --- /dev/null +++ b/challenge-334/ulrich-rieke/rust/ch-1.rs @@ -0,0 +1,16 @@ +use std::io ; + +fn main() { + println!("Enter some integers separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let numbers : Vec<i32> = inline.trim( ).split_whitespace( ).map( |s| + s.parse::<i32>( ).unwrap( )).collect( ) ; + println!( "Enter a pair of indices valid into the above numbers!") ; + let mut indexline : String = String::new( ) ; + io::stdin( ).read_line( &mut indexline ).unwrap( ) ; + let indices : Vec<usize> = indexline.trim( ).split_whitespace( ).map( |s| + s.parse::<usize>( ).unwrap( )).collect( ) ; + println!("{}" , numbers.into_iter( ).skip( indices[0] ).take( indices[1] + - indices[0] + 1 ).sum::<i32>( ) ) ; +} diff --git a/challenge-334/ulrich-rieke/rust/ch-2.rs b/challenge-334/ulrich-rieke/rust/ch-2.rs new file mode 100755 index 0000000000..cab14e59d2 --- /dev/null +++ b/challenge-334/ulrich-rieke/rust/ch-2.rs @@ -0,0 +1,44 @@ +use std::io ; +use regex::Regex ; + +fn manhattan( first_pair : &(i32 , i32) , second_pair: &(i32 , i32) ) -> u32 { + first_pair.0.abs_diff( second_pair.0) + first_pair.1.abs_diff( + second_pair.1) +} + +fn main() { + println!("Enter 2 integers separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let nums : Vec<i32> = inline.trim( ).split_whitespace( ).map( |s| + s.parse::<i32>().unwrap( ) ).collect( ) ; + let comparison : (i32 , i32) = (nums[0] , nums[1] ) ; + println!("Enter some integer coordinates in brackets separated by blanks!") ; + let mut coordline : String = String::new( ) ; + io::stdin( ).read_line( &mut coordline ).unwrap( ) ; + let coords : &str = coordline.trim() ; + let coordre = Regex::new(r"\[.+?\]").unwrap( ) ; + let coordinates : Vec<&str> = coordre.find_iter( coords ).map( |m| + m.as_str( ) ).collect( ) ; + let numberre = Regex::new(r"\d+" ).unwrap( ) ; + let points : Vec<(i32, i32)> = coordinates.into_iter().map( |s| { + let numbers : Vec<i32> = numberre.find_iter( s ).map( |m| { + let found = m.as_str( ) ; + let number : i32 = found.parse::<i32>( ).unwrap( ) ; + number }).collect( ) ; + (numbers[0] , numbers[1] ) }).collect( ) ; + let valid_points : Vec<(usize, &(i32 , i32))> = points.iter( ).enumerate( ). + filter( |&(_ , (x , y))| *x == comparison.0 || *y == comparison.1 ).collect( ); + let distances : Vec<(usize , u32)> = valid_points.iter( ).map( |p| (p.0 , + manhattan( &p.1 , &comparison ))).collect( ) ; + let result : i32 = match distances.len() { + 0 => -1 , + 1 => distances[0].0 as i32 , + _ => { + let mini_pair : &(usize , u32 ) = distances.iter().min_by( |p , q| p.1. + cmp(&q.1)).unwrap( ) ; + mini_pair.0 as i32 + } + } ; + println!("{}" , result ) ; +} diff --git a/stats/pwc-current.json b/stats/pwc-current.json index 91a9d7e9b8..95140bce09 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -217,6 +217,20 @@ 2 ], [ + "Raku", + 2 + ] + ], + "id" : "Ulrich Rieke", + "name" : "Ulrich Rieke" + }, + { + "data" : [ + [ + "Perl", + 2 + ], + [ "Blog", 1 ] @@ -328,6 +342,11 @@ "y" : 4 }, { + "drilldown" : "Ulrich Rieke", + "name" : "Ulrich Rieke", + "y" : 4 + }, + { "drilldown" : "W. Luis Mochan", "name" : "W. Luis Mochan", "y" : 3 @@ -337,7 +356,7 @@ } ], "subtitle" : { - "text" : "[Champions: 18] Last updated at 2025-08-14 08:59:51 GMT" + "text" : "[Champions: 19] Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge - 334" diff --git a/stats/pwc-language-breakdown-2019.json b/stats/pwc-language-breakdown-2019.json index 25e98643f4..207ff310a6 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-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2020.json b/stats/pwc-language-breakdown-2020.json index 3e58aaa0e4..2518f5f508 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-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2021.json b/stats/pwc-language-breakdown-2021.json index b522fd815b..1f1f9d83df 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-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2022.json b/stats/pwc-language-breakdown-2022.json index 5e230f1392..7d5eb30e02 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-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2023.json b/stats/pwc-language-breakdown-2023.json index a102bcb498..00f786ae73 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-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2024.json b/stats/pwc-language-breakdown-2024.json index b95b8aae6f..346f82ffb8 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-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2025.json b/stats/pwc-language-breakdown-2025.json index 794341413b..64857d91e9 100644 --- a/stats/pwc-language-breakdown-2025.json +++ b/stats/pwc-language-breakdown-2025.json @@ -8,11 +8,11 @@ "data" : [ [ "Perl", - 24 + 26 ], [ "Raku", - 18 + 20 ], [ "Blog", @@ -601,7 +601,7 @@ { "drilldown" : "334", "name" : "334", - "y" : 50 + "y" : 54 }, { "drilldown" : "333", @@ -763,7 +763,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index 427f8e3f2c..46d4d9b970 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -10,11 +10,11 @@ "data" : [ [ "Perl", - 17228 + 17230 ], [ "Raku", - 9597 + 9599 ], [ "Blog", @@ -37,7 +37,7 @@ } ], "subtitle" : { - "text" : "Last updated at 2025-08-14 08:59:51 GMT" + "text" : "Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "The Weekly Challenge Contributions [2019 - 2025]" diff --git a/stats/pwc-leaders.json b/stats/pwc-leaders.json index 0d0fc31076..83deaa0417 100644 --- a/stats/pwc-leaders.json +++ b/stats/pwc-leaders.json @@ -112,11 +112,11 @@ "data" : [ [ "Perl", - 504 + 506 ], [ "Raku", - 512 + 514 ] ], "id" : "Ulrich Rieke", @@ -827,7 +827,7 @@ { "drilldown" : "Ulrich Rieke", "name" : "7: Ulrich Rieke", - "y" : 2032 + "y" : 2040 }, { "drilldown" : "Flavio Poletti", @@ -1049,7 +1049,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the score breakdown. Last updated at 2025-08-14 08:59:51 GMT" + "text" : "Click the columns to drilldown the score breakdown. Last updated at 2025-08-14 09:06:12 GMT" }, "title" : { "text" : "Team Leaders (TOP 50)" diff --git a/stats/pwc-summary-1-30.json b/stats/pwc-summary-1-30.json index 396c35fd37..36f726b366 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-08-14 08:59:51 GMT" + "text" : "[Champions: 30] Last updated at 2025-08-14 09:06:12 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 8e85022b73..81c9c1e836 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-08-14 08:59:51 GMT" + "text" : "[Champions: 30] Last updated at 2025-08-14 09:06:12 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 db8461c67a..05562b82e3 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-08-14 08:59:51 GMT" + "text" : "[Champions: 30] Last updated at 2025-08-14 09:06:12 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 fac5faf474..15c6b5f477 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-08-14 08:59:51 GMT" + "text" : "[Champions: 30] Last updated at 2025-08-14 09:06:12 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 22fa65bb4f..904841aef5 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-08-14 08:59:51 GMT" + "text" : "[Champions: 30] Last updated at 2025-08-14 09:06:12 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 5b0cf53a58..5afe1def46 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-08-14 08:59:51 GMT" + "text" : "[Champions: 30] Last updated at 2025-08-14 09:06:12 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 a2c7d1a1bb..60fb06ebc1 100644 --- a/ |