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 22, 2025 20:45Gerard SmitGerard SmitScore: 310,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 20:45308,68410,217,887,09610,089,651,00096,919,0002,338,816
2Jan 22, 2025 20:45310,07610,266,371,50110,121,615,000110,908,0002,342,912
3Jan 22, 2025 20:45315,67010,455,223,21210,304,202,000112,903,0002,281,472