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 listDec 20, 2025 14:40Rajarshi BasuRajarshi BasuScore: 5,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 14:405,038190,030,959162,260,0004,006,0002,351,104
2Dec 20, 2025 14:405,044190,627,059163,451,0002,989,0002,523,136
3Dec 20, 2025 14:405,060196,319,770160,988,0005,999,0002,281,472
4Dec 20, 2025 14:405,067188,544,230163,201,0004,004,0002,269,184
5Dec 20, 2025 14:405,069189,538,965162,254,0005,007,0002,514,944
6Dec 20, 2025 14:405,072190,569,153165,363,0002,004,0002,523,136
7Dec 20, 2025 14:405,082192,866,455164,723,0002,994,0002,523,136
8Dec 20, 2025 14:405,083194,795,096160,757,0006,989,0002,342,912
9Dec 20, 2025 14:405,083191,945,825162,754,0004,992,0002,523,136