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 listSep 17, 2024 18:36Matvey BunosMatvey BunosScore: 141,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2024 18:36140,6214,670,041,4804,505,578,000134,927,0002,445,312
2Sep 17, 2024 18:36141,0204,680,384,8234,512,719,000140,928,0002,445,312
3Sep 17, 2024 18:36143,2444,762,117,0244,590,126,000136,914,0002,482,176