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 08:15Andrew EpsteinAndrew EpsteinScore: 1,485Success
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 08:241,46143,849,79699,996,0001,285,0002,150,400stderr
2Oct 31, 2026 08:241,46143,853,121100,217,0001,208,0002,150,400stderr
3Oct 31, 2026 08:241,47144,138,281101,299,0001,135,0002,154,496stderr
4Oct 31, 2026 08:241,47744,322,739102,028,0001,014,0002,150,400stderr
5Oct 31, 2026 08:241,48544,564,481102,401,0001,032,0002,154,496stderr
6Oct 31, 2026 08:241,48944,691,306103,053,0001,035,0002,170,880stderr
7Oct 31, 2026 08:241,49044,700,120103,100,0001,171,0002,150,400stderr
8Oct 31, 2026 08:241,51945,575,639105,775,0001,035,0002,154,496stderr
9Oct 31, 2026 08:241,52445,733,945104,894,0001,038,0002,154,496stderr