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 01:53Andrew EpsteinAndrew EpsteinScore: 465,569Success
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 01:53465,05315,407,113,10215,346,755,76902,199,552
2Jul 3, 2023 01:53465,56915,420,854,32415,363,773,56002,207,744
3Jul 3, 2023 01:53471,25315,614,829,49415,551,336,74402,195,456