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 listNov 11, 2024 10:19E SequeiraE SequeiraScore: 233,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 10:19226,9487,519,503,2937,461,294,00027,982,0002,359,296
2Nov 11, 2024 10:19233,2797,736,051,8747,673,227,00024,981,0002,289,664
3Nov 11, 2024 10:19234,5737,776,067,9927,715,925,00024,986,0002,359,296