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:57Yuriy LyfenkoYuriy LyfenkoScore: 10,745Success
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:5710,641379,349,623343,180,0007,980,0002,367,488
2Sep 26, 2024 14:5710,745382,875,635349,591,0004,994,0002,314,240
3Sep 26, 2024 14:5710,887385,010,366353,296,0005,988,0002,379,776