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 listJun 7, 2026 16:13anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:1401,172,923,0391,108,983,00054,354,0002,113,536expected "1020118 ", got "1019806 "
2Jun 7, 2026 16:1401,170,171,5901,106,238,00054,527,0002,113,536expected "1024551 ", got "1024237 "
3Jun 7, 2026 16:1401,191,847,7451,128,485,00053,625,0002,113,536expected "1025713 ", got "1025424 "