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 listFeb 7, 2025 21:42E SequeiraE SequeiraScore: 93,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2025 21:4293,4813,119,254,5903,062,884,00021,984,0002,482,176
2Feb 7, 2025 21:4293,7403,117,903,9533,070,428,00022,988,0002,281,472
3Feb 7, 2025 21:4294,1243,133,814,9433,084,118,00021,986,0002,461,696