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:09olliecrowolliecrowScore: 33,981Success
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:0932,7401,109,755,2601,059,417,00020,988,0002,433,024
2Apr 1, 2026 14:0933,9811,151,225,0171,099,370,00021,987,0002,437,120
3Apr 1, 2026 14:0934,3531,159,630,4981,115,681,00017,978,0002,433,024