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 27, 2025 22:24Oleg KovalovOleg KovalovScore: 100,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 22:24100,9113,360,621,4203,320,064,0009,994,0002,457,600
2Jan 27, 2025 22:24100,9393,361,797,6073,322,998,0007,995,0002,453,504
3Jan 27, 2025 22:24101,2713,375,911,4753,326,969,00014,990,0002,461,696