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 listJun 1, 2021 09:25Mikhail MaximovMikhail MaximovScore: 438,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2021 09:25438,24514,519,583,73014,462,100,71702,207,744
2Jun 1, 2021 09:25438,91114,534,588,05214,484,064,91802,260,992
3Jun 1, 2021 09:25439,90714,572,813,75114,516,924,95302,285,568