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 3, 2026 05:12Rajarshi BasuRajarshi BasuScore: 4,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 05:114,928198,378,145158,644,0003,991,0002,510,848
2Jan 3, 2026 05:114,939190,517,243159,002,0004,000,0002,297,856
3Jan 3, 2026 05:124,959189,766,104160,658,0002,993,0002,510,848
4Jan 3, 2026 05:114,962185,346,202159,758,0003,993,0002,297,856
5Jan 3, 2026 05:124,966185,508,593158,892,0004,996,0002,297,856
6Jan 3, 2026 05:125,034188,770,427162,113,0004,002,0002,297,856