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 listDec 20, 2025 14:40Rajarshi BasuRajarshi BasuScore: 5,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 14:405,044196,467,350162,455,0004,011,0002,449,408
2Dec 20, 2025 14:405,065188,556,361164,141,0003,002,0002,469,888
3Dec 20, 2025 14:405,085192,980,138162,814,0004,994,0002,351,104
4Dec 20, 2025 14:405,086194,359,293161,858,0005,994,0002,519,040
5Dec 20, 2025 14:405,094191,786,234162,088,0006,003,0002,342,912
6Dec 20, 2025 14:405,094195,808,499161,101,0007,004,0002,392,064
7Dec 20, 2025 14:405,094192,153,465165,111,0003,002,0002,519,040
8Dec 20, 2025 14:405,105201,580,706162,474,0005,980,0002,269,184
9Dec 20, 2025 14:405,124191,863,992163,084,0006,003,0002,408,448