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 listJan 13, 2026 23:08Adam FolwarcznyAdam FolwarcznyScore: 419,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 23:08418,67713,853,223,3586,697,803,0007,118,540,0002,347,008
2Jan 13, 2026 23:08419,60613,883,791,2806,692,129,0007,154,862,0002,523,136
3Jan 13, 2026 23:08420,35213,906,408,5296,728,418,0007,143,197,0002,514,944