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 listApr 20, 2026 15:26BenBenScore: 75,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:2775,4212,522,464,0652,439,961,00048,959,0002,383,872
2Apr 20, 2026 15:2775,8292,536,464,9842,460,415,00041,972,0002,437,120
3Apr 20, 2026 15:2776,7842,558,654,7592,490,894,00042,980,0002,424,832