Unique strings Sergey Svistunov

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 listJan 9, 2026 02:56Josu San MartinJosu San MartinScore: 10,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 02:5610,878389,129,460350,978,0007,999,0002,326,528
2Jan 9, 2026 02:5610,918388,552,361354,275,0006,004,0002,289,664
3Jan 9, 2026 02:5611,228401,458,548364,516,0005,992,0002,514,944