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 listMar 1, 2025 23:06PhibPhibScore: 107,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2025 23:06106,9893,558,834,7063,510,650,00019,986,0002,445,312
2Mar 1, 2025 23:06107,0053,558,857,5093,516,178,00014,987,0002,281,472
3Mar 1, 2025 23:06108,4933,608,101,2323,562,285,00017,986,0002,449,408