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 18, 2026 18:34Charles CabergsCharles CabergsScore: 84,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 18:3484,6882,832,057,8392,456,980,000337,722,0002,449,408
2Apr 18, 2026 18:3484,9192,846,691,8262,472,001,000330,332,0002,437,120
3Apr 18, 2026 18:3485,0702,847,946,3732,476,634,000330,684,0002,437,120