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 21, 2025 01:18izotoffizotoffScore: 30,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 01:1829,5751,004,837,752970,973,0004,999,0002,490,368
2Nov 21, 2025 01:1830,1051,020,193,713987,484,0005,996,0002,330,624
3Nov 21, 2025 01:1830,2171,025,109,486992,154,0004,995,0002,478,080