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 listAug 28, 2022 08:18Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2022 08:1800000Error: expected "1024757 ", got "1024756"
2Aug 28, 2022 08:1800000Error: expected "1026260 ", got "1026259"
3Aug 28, 2022 08:1811,120439,299,457366,970,89502,277,376
4Aug 28, 2022 08:1811,487446,975,492379,061,55802,281,472
5Aug 28, 2022 08:1811,490450,572,125379,173,96902,248,704