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 7, 2023 16:32Andrew EpsteinAndrew EpsteinScore: 178,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2023 16:32176,7915,891,593,0945,834,092,86402,211,840
2Jul 7, 2023 16:32178,2655,948,894,8705,882,757,44502,211,840
3Jul 7, 2023 16:32178,3755,947,098,0125,886,372,92902,220,032