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 11, 2026 20:36Pavel SkripkinPavel SkripkinScore: 57,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 20:3656,9021,906,590,8721,872,766,0004,996,0002,424,832
2Jan 11, 2026 20:3657,1741,913,724,6141,880,754,0005,996,0002,424,832
3Jan 11, 2026 20:3658,3651,953,749,7921,921,057,0004,997,0002,277,376