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 10, 2026 22:35Josu San MartinJosu San MartinScore: 4,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 22:354,476174,369,277145,702,0001,995,0002,289,664
2Jan 10, 2026 22:354,476183,437,227145,721,0001,996,0002,289,664
3Jan 10, 2026 22:414,476182,967,483146,706,000998,0002,396,160
4Jan 10, 2026 22:414,476169,969,866145,719,0001,996,0002,289,664
5Jan 10, 2026 22:414,476173,613,433146,719,000998,0002,396,160
6Jan 10, 2026 22:354,478173,741,446146,779,000998,0002,289,664