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 1, 2026 14:28olliecrowolliecrowScore: 33,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 14:2832,5741,106,014,4421,057,975,00016,983,0002,437,120
2Apr 1, 2026 14:2833,3731,129,579,9491,081,332,00019,969,0002,355,200
3Apr 1, 2026 14:2833,9651,155,219,5351,103,883,00016,967,0002,375,680