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 listApr 7, 2025 22:03Aniruddha DebAniruddha DebScore: 21,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2025 22:0321,140720,666,775682,642,00014,992,0002,367,488
2Apr 7, 2025 22:0321,641734,251,681703,177,00010,987,0002,453,504
3Apr 7, 2025 22:0321,742744,921,762703,507,00013,990,0002,416,640