Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 5, 2026 15:27Victor MerckléVictor MerckléScore: 6,445Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 15:295,855175,677,956489,443,0009,089,0002,600,960
2Jun 5, 2026 15:295,866176,001,543485,065,0007,986,0002,596,864
3Jun 5, 2026 15:295,880176,400,936484,410,0009,036,0002,596,864
4Jun 5, 2026 15:296,367191,039,796518,854,0009,327,0002,596,864
5Jun 5, 2026 15:296,445193,359,271522,729,0008,452,0002,600,960
6Jun 5, 2026 15:296,461193,854,032525,660,0007,966,0002,596,864
7Jun 5, 2026 15:296,518195,565,095523,746,0007,890,0002,596,864
8Jun 5, 2026 15:296,565196,975,846550,622,0006,943,0002,596,864
9Jun 5, 2026 15:296,646199,396,941531,974,0006,856,0002,596,864