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 listOct 3, 2024 11:15Joad NacerJoad NacerScore: 50,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2024 11:1548,9621,649,446,6181,612,734,0002,999,0002,547,712
2Oct 3, 2024 11:1550,3631,688,128,7591,658,968,0002,998,0002,355,200
3Oct 3, 2024 11:1550,5401,693,896,6781,665,826,0001,998,0002,547,712