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 25, 2025 00:15Ian MckibbenIan MckibbenScore: 572,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 00:15566,20218,721,988,17918,615,721,00068,954,0002,338,816
2Jun 25, 2025 00:15572,07118,927,948,60818,801,408,00076,936,0002,531,328
3Jun 25, 2025 00:15585,39919,359,300,97719,244,232,00073,935,0002,306,048