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 10, 2025 02:55Ian MckibbenIan MckibbenScore: 135,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 02:55133,8474,455,373,7764,401,947,00014,993,0002,478,080
2Jan 10, 2025 02:55134,1104,457,224,0874,407,649,00017,990,0002,519,040
3Jan 10, 2025 02:55134,1774,459,502,5244,413,846,00013,990,0002,396,160
4Jan 10, 2025 02:55134,8564,474,657,7184,430,261,00019,987,0002,297,856
5Jan 10, 2025 02:55135,7074,508,959,8344,457,336,00020,987,0002,433,024
6Jan 10, 2025 02:55135,9524,513,866,8584,474,409,00011,993,0002,347,008
7Jan 10, 2025 02:55136,4004,530,074,0814,485,195,00015,990,0002,461,696
8Jan 10, 2025 02:55137,1484,558,634,3974,501,895,00023,983,0002,355,200
9Jan 10, 2025 02:55137,1974,555,396,6444,508,525,00018,989,0002,306,048