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 listNov 9, 2024 23:17E SequeiraE SequeiraScore: 296,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2024 23:17296,6619,826,888,3709,766,816,00022,987,0002,478,080
2Nov 9, 2024 23:17296,8749,828,117,1799,761,877,00034,981,0002,387,968
3Nov 9, 2024 23:17299,3429,912,594,7289,846,316,00031,978,0002,535,424