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 listJan 13, 2025 08:36Ian MckibbenIan MckibbenScore: 29,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 08:3629,6901,011,149,958901,797,00077,982,0002,347,008
2Jan 13, 2025 08:3629,7001,006,373,669892,189,00087,920,0002,355,200
3Jan 13, 2025 08:3629,7071,001,613,509889,380,00090,936,0002,306,048
4Jan 13, 2025 08:3629,7081,009,241,507889,437,00090,942,0002,510,848
5Jan 13, 2025 08:3629,7931,009,302,889893,258,00089,925,0002,396,160
6Jan 13, 2025 08:3629,8231,009,165,617884,237,00099,913,0002,400,256
7Jan 13, 2025 08:3629,8301,007,688,112901,430,00082,947,0002,510,848
8Jan 13, 2025 08:3629,8551,014,274,064892,291,00092,926,0002,387,968
9Jan 13, 2025 08:3629,9711,021,355,321908,132,00080,922,0002,269,184