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 22, 2025 06:04Ian MckibbenIan MckibbenScore: 16,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 06:0416,854581,389,887468,151,00088,028,0002,289,664
2Jun 22, 2025 06:0416,925580,217,554467,606,00090,923,0002,428,928
3Jun 22, 2025 06:0416,957586,677,523468,645,00090,931,0002,375,680
4Jun 22, 2025 06:0416,958584,161,091472,685,00086,942,0002,285,568
5Jun 22, 2025 06:0416,961582,922,662474,765,00084,957,0002,375,680
6Jun 22, 2025 06:0416,998582,990,404473,953,00086,991,0002,478,080
7Jun 22, 2025 06:0417,049589,599,406487,673,00074,949,0002,539,520
8Jun 22, 2025 06:0417,103587,071,270483,483,00080,913,0002,281,472
9Jun 22, 2025 06:0417,159593,713,399482,361,00083,888,0002,490,368