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 listOct 31, 2026 07:55Andrew EpsteinAndrew EpsteinScore: 1,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 07:571,45943,799,51699,987,0001,214,0002,162,688stderr
2Oct 31, 2026 07:571,46644,001,386100,224,0001,203,0002,162,688stderr
3Oct 31, 2026 07:571,49244,788,720103,310,0001,181,0002,162,688stderr
4Oct 31, 2026 07:571,50445,142,582104,229,0001,048,0002,162,688stderr
5Oct 31, 2026 07:571,50845,243,127104,421,0001,214,0002,162,688stderr
6Oct 31, 2026 07:571,51345,417,915104,962,0001,138,0002,162,688stderr
7Oct 31, 2026 07:571,51545,474,559104,484,0001,293,0002,158,592stderr
8Oct 31, 2026 07:571,51545,461,054104,779,0001,176,0002,162,688stderr
9Oct 31, 2026 07:571,53946,176,957102,286,0002,023,0002,162,688stderr