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 1, 2026 16:13CodeReclaimersCodeReclaimersScore: 7,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 16:147,047243,486,341228,331,0004,223,0002,113,536
2Aug 1, 2026 16:147,085244,074,974229,538,0004,290,0002,113,536
3Aug 1, 2026 16:147,091244,173,035229,825,0004,181,0002,113,536
4Aug 1, 2026 16:147,106244,631,289230,183,0004,318,0002,113,536
5Aug 1, 2026 16:147,117245,061,439230,551,0004,336,0002,113,536
6Aug 1, 2026 16:147,128246,038,765230,790,0004,437,0002,113,536
7Aug 1, 2026 16:147,144245,836,581231,401,0004,364,0002,113,536
8Aug 1, 2026 16:147,202247,879,848233,132,0004,562,0002,113,536
9Aug 1, 2026 16:147,212248,215,996233,496,0004,500,0002,113,536