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 21, 2026 23:29Josu San MartinJosu San MartinScore: 4,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2026 23:294,716188,310,917153,641,0001,995,0002,297,856
2Jan 21, 2026 23:294,720186,874,894152,756,0002,995,0002,269,184
3Jan 21, 2026 23:294,727177,836,133152,997,0002,999,0002,297,856