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:39Rajarshi BasuRajarshi BasuScore: 5,082Success
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:395,033191,798,006161,092,0005,002,0002,527,232
2Dec 20, 2025 14:395,041190,271,824160,329,0006,012,0002,457,600
3Dec 20, 2025 14:395,044199,824,274160,431,0006,016,0002,457,600
4Dec 20, 2025 14:395,064195,491,128160,119,0007,005,0002,289,664
5Dec 20, 2025 14:395,082191,751,454162,703,0004,990,0002,437,120
6Dec 20, 2025 14:395,087189,725,456161,865,0005,995,0002,514,944
7Dec 20, 2025 14:395,134196,831,328163,407,0006,014,0002,289,664
8Dec 20, 2025 14:395,140197,110,958165,627,0003,991,0002,523,136
9Dec 20, 2025 14:395,173196,757,934164,716,0005,989,0002,404,352