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,541Success
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:1550,1761,685,351,2571,651,811,0003,997,0002,449,408
2Oct 3, 2024 11:1550,5411,698,249,7091,663,860,0003,997,0002,453,504
3Oct 3, 2024 11:1551,0641,717,132,3201,681,130,0003,997,0002,351,104