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 listJun 21, 2025 17:03Ian MckibbenIan MckibbenScore: 442,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 17:03441,11014,593,241,84114,441,690,000114,933,0002,519,040
2Jun 21, 2025 17:03442,65914,645,296,87914,497,815,000109,937,0002,289,664
3Jun 21, 2025 17:03445,82814,752,186,15014,587,404,000124,917,0002,453,504