Round #591
09 May 2026, 23:20· csharp· Meta-Llama-3.3-70B-Instruct· r13-clean-hints
- Complexity
- band 0
- ZP / UO / OBS
- 3 / 0 / 1
- Journey weight
- 200
- Lightshift ΔL
- —
Prompt
Find the date with the highest number of new signups in a users table.
Zero-point index (what the engine surfaced)
ZPI-ZPI-0025 | 2026-05-09T23:20:41Z
Find the date with the highest number of new signups in a users table.
ZERO POINT — 3 entries (structural invariants)
● hsl(7.18, 100%, 50%) class [feature]
● hsl(0.00, 100%, 50%) public [feature]
● hsl(84.10, 100%, 50%) namespace [feature]
UNOBSERVED — 0 entries (implied truths)
OBSERVED — 1 entries (explicit in request)
◉ hsl(98.46, 100%, 50%) with [feature]
COMPLEXITY │ 4 entries │ spread: 0° │ band: LOW
Baseline response (no ZPI)
```csharp
using System;
using System.Collections.Generic;
using System.Linq;
public class User
{
public string Name { get; set; }
public DateTime SignupDate { get; set; }
}
class Program
{
static void Main()
{
var users = new List<User>
{
new User { Name = "John", SignupDate = DateTime.Parse("2022-01-01") },
new User { Name = "Jane", SignupDate = DateTime.Parse("2022-01-01") },
new User { Name = "Alice", SignupDate = DateTime.Parse("2022-01-02") },
new User { Name = "Bob", SignupDate = DateTime.Parse("2022-01-03") },
new User { Name = "Charlie", SignupDate = DateTime.Parse("2022-01-03") },
new User { Name = "Dave", SignupDate = DateTime.Parse("2022-01-03") },
};
var signupCounts = users.GroupBy(u => u.SignupDate)
.OrderByDescending(g => g.Count())
.FirstOrDefault();
Console.WriteLine($"The date with the highest number of new signups is: {signupCounts.Key.ToString("yyyy-MM-dd")}");
}
}
```
Enhanced response (with ZPI)
```csharp
using System;
using System.Collections.Generic;
using System.Linq;
public class User
{
public DateTime SignupDate { get; set; }
}
public class Program
{
public static DateTime FindDateWithMostSignups(List<User> users)
{
if (users == null || users.Count == 0)
{
throw new ArgumentException("Users list is empty");
}
var signupCounts = users
.GroupBy(u => u.SignupDate.Date)
.OrderByDescending(g => g.Count())
.FirstOrDefault();
return signupCounts.Key;
}
public static void Main()
{
var users = new List<User>
{
new User { SignupDate = DateTime.Parse("2022-01-01") },
new User { SignupDate = DateTime.Parse("2022-01-01") },
new User { SignupDate = DateTime.Parse("2022-01-02") },
new User { SignupDate = DateTime.Parse("2022-01-03") },
new User { SignupDate = DateTime.Parse("2022-01-03") },
new User { SignupDate = DateTime.Parse("2022-01-03") },
};
var dateWithMostSignups = FindDateWithMostSignups(users);
Console.WriteLine(dateWithMostSignups);
}
}
```
This C# code defines a `User` class with a `SignupDate` property and a `FindDateWithMostSignups` method that takes a list of `User` objects as input. The method groups the users by their signup date, orders the groups by the count of users in each group in descending order, and returns the date with the highest count.
In the `Main` method, we create a list of `User` objects with different signup dates and call the `FindDateWithMostSignups` method to find the date with the most signups. The result is then printed to the console.
Note that this code assumes that the `SignupDate` property is of type `DateTime`. If the property is of a different type, you may need to modify the code accordingly. Also, this code does not handle the case where there are multiple dates with the same highest count of signups. If you need to handle this case, you can modify the code to return a list of dates with the highest count.
Grader chain
Each grader reads the same baseline + enhanced pair and casts an independent verdict. Disagreement is the framework's own signal — not noise to be averaged away.
V1samba/Meta-Llama-3.3-70B-Instruct
BetterV4qwen2.5-coder-3b-instruct
BetterV5openrouter/qwen/qwen3-235b-a22b-2507
BetterV7qwen2.5-coder-7b-instruct
BetterV8openai/gpt-4.1
BetterV9anthropic/claude-opus-4-7
BetterV12openai/gpt-4o
BetterComments
Our grader said what it said. What do you say? Comment as a guest below.
No comments yet. Be the first to say what you make of this round.