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 listSep 26, 2024 14:58Yuriy LyfenkoYuriy LyfenkoScore: 11,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2024 14:5811,428402,971,352373,120,0004,001,0002,285,568
2Sep 26, 2024 14:5811,649418,837,872378,423,0005,990,0002,486,272
3Sep 26, 2024 14:5811,695413,949,538381,945,0003,999,0002,367,488