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 4, 2024 13:57Yuriy LyfenkoYuriy LyfenkoScore: 11,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 13:5711,162400,614,466354,333,00014,013,0002,383,872
2Sep 4, 2024 13:5711,168394,851,293353,551,00014,980,0002,412,544
3Sep 4, 2024 13:5711,172397,362,316354,693,00013,987,0002,469,888
4Sep 4, 2024 13:5711,199405,458,107354,588,00014,982,0002,416,640
5Sep 4, 2024 13:5711,247402,910,224355,133,00016,006,0002,314,240
6Sep 4, 2024 13:5711,248406,141,333358,183,00013,006,0002,314,240