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 13:45Rajarshi 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 13:455,081193,057,971163,678,0003,992,0002,519,040
2Dec 20, 2025 13:455,084197,189,583160,793,0006,991,0002,355,200
3Dec 20, 2025 13:455,087189,533,657162,889,0004,996,0002,392,064
4Dec 20, 2025 13:455,090192,170,803163,977,0003,999,0002,519,040
5Dec 20, 2025 13:455,094191,000,970162,113,0006,004,0002,387,968
6Dec 20, 2025 13:455,098196,487,524161,210,0007,009,0002,482,176
7Dec 20, 2025 13:455,118192,531,215162,903,0005,996,0002,375,680
8Dec 20, 2025 13:455,140198,022,058163,633,0005,986,0002,514,944
9Dec 20, 2025 13:455,276203,475,591169,097,0005,002,0002,379,776