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 listOct 14, 2025 02:29Nguyen Thanh VinhNguyen Thanh VinhScore: 328,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2025 02:29320,58610,612,793,21510,497,392,00081,940,0002,449,408
2Oct 14, 2025 02:29328,49610,869,387,28910,730,420,000109,932,0002,461,696
3Oct 14, 2025 02:29340,95611,280,673,87311,132,627,000118,921,0002,457,600