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 listDec 29, 2024 07:02Yuriy LyfenkoYuriy LyfenkoScore: 9,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 07:028,977326,229,405290,238,0006,004,0002,355,200
2Dec 29, 2024 07:029,047328,704,800292,572,0005,991,0002,519,040
3Dec 29, 2024 07:029,092323,372,631295,025,0005,000,0002,514,944