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 listJul 20, 2025 14:01Aniruddha DebAniruddha DebScore: 17,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2025 14:0117,665606,088,123543,949,00038,996,0002,379,776
2Jul 20, 2025 14:0117,668609,553,732546,090,00036,938,0002,387,968
3Jul 20, 2025 14:0117,671609,852,122547,206,00035,947,0002,383,872
4Jul 20, 2025 14:0117,704612,129,804546,270,00037,949,0002,383,872
5Jul 20, 2025 14:0117,794614,666,943555,237,00031,956,0002,383,872
6Jul 20, 2025 14:0117,796616,134,910556,294,00030,960,0002,383,872
7Jul 20, 2025 14:0117,808619,841,378549,684,00037,978,0002,392,064
8Jul 20, 2025 14:0118,073626,917,991559,519,00036,902,0002,469,888
9Jul 20, 2025 14:0118,293629,280,720564,749,00038,913,0002,392,064