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 20:20Charles CabergsCharles CabergsScore: 99,598Success
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 20:2199,1433,302,246,3213,257,746,00013,990,0002,297,856
2Apr 20, 2026 20:2199,5983,316,297,2443,268,756,00017,993,0002,342,912
3Apr 20, 2026 20:21101,6123,380,335,3483,335,231,00017,990,0002,461,696