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 14, 2024 10:58Yerkimbekov AlisherYerkimbekov AlisherScore: 482,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2024 10:58481,15415,933,263,26315,878,072,61502,252,800
2Jun 14, 2024 10:58482,17515,977,183,44715,911,765,30102,281,472
3Jun 14, 2024 10:58483,62716,036,136,64515,959,678,21002,256,896