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 listNov 12, 2025 16:11Aliaksandr MikheiAliaksandr MikheiScore: 96,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 16:1196,2443,201,693,4533,117,113,00058,945,0002,383,872
2Nov 12, 2025 16:1196,4783,208,691,2993,124,831,00058,959,0002,342,912
3Nov 12, 2025 16:1197,1603,237,645,4073,138,329,00067,942,0002,478,080