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 listDec 16, 2025 11:40AndreiAndreiScore: 91,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2025 11:4091,1503,036,762,2602,914,977,00092,967,0002,277,376
2Dec 16, 2025 11:4091,5283,044,656,0912,915,472,000104,945,0002,293,760
3Dec 16, 2025 11:4092,7813,094,203,8462,962,799,00098,959,0002,293,760