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 listJul 3, 2023 03:06Andrew EpsteinAndrew EpsteinScore: 292,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 03:06291,8759,711,457,8929,631,858,57702,260,992
2Jul 3, 2023 03:06292,6769,714,078,4729,658,308,54502,260,992
3Jul 3, 2023 03:06292,9419,736,055,4779,667,059,50802,265,088