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 4, 2024 13:38Yuriy LyfenkoYuriy LyfenkoScore: 11,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 13:3811,111393,339,135350,663,00015,984,0002,375,680
2Sep 4, 2024 13:3811,144391,574,278354,764,00012,991,0002,318,336
3Sep 4, 2024 13:3811,524410,746,466362,339,00017,967,0002,334,720