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 9, 2025 11:03Ian MckibbenIan MckibbenScore: 193,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 11:03192,1466,380,527,3956,323,840,00016,986,0002,387,968
2Jan 9, 2025 11:03193,2216,413,384,1846,356,321,00019,982,0002,281,472
3Jan 9, 2025 11:03193,3416,411,124,3836,355,285,00024,977,0002,375,680