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 4, 2023 01:28Andrew EpsteinAndrew EpsteinScore: 174,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2023 01:28173,5235,778,208,0795,726,256,40902,191,360
2Jul 4, 2023 01:28174,7205,831,760,4415,765,752,26402,187,264
3Jul 4, 2023 01:28174,9505,834,605,6515,773,354,82602,195,456