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 listOct 25, 2026 05:59Nao MinamiNao MinamiScore: 192,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 05:59191,6696,336,274,5886,272,388,00052,710,0002,113,536
2Oct 25, 2026 05:59192,3936,360,075,5026,291,618,00057,352,0002,113,536
3Oct 25, 2026 05:59193,9886,412,761,6416,352,473,00049,140,0002,113,536