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 listMar 6, 2026 23:32Pavel SamyginPavel SamyginScore: 107,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 23:32107,2223,570,167,0553,518,334,00019,990,0002,297,856
2Mar 6, 2026 23:32107,4243,580,279,1593,522,004,00022,986,0002,416,640
3Mar 6, 2026 23:32108,2673,596,281,1333,549,832,00022,985,0002,269,184