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 11, 2025 21:39Leon ZhaoLeon ZhaoScore: 30,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 21:3930,1681,022,003,828929,571,00065,969,0002,449,408
2Aug 11, 2025 21:3930,2221,022,368,523942,350,00054,962,0002,277,376
3Aug 11, 2025 21:3930,6501,037,701,967955,522,00055,913,0002,383,872