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 21, 2025 13:28Cameron AavikCameron AavikScore: 32,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 13:2832,3581,097,957,6791,005,822,00061,989,0002,392,064
2Jan 21, 2025 13:2832,4791,101,414,1861,003,834,00067,988,0002,293,760
3Jan 21, 2025 13:2832,5891,102,172,6181,004,490,00070,963,0002,293,760