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 19, 2025 17:32Rajarshi BasuRajarshi BasuScore: 6,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 17:316,543242,910,277208,920,0006,997,0002,514,944
2Dec 19, 2025 17:316,546243,125,731210,005,0006,000,0002,310,144
3Dec 19, 2025 17:316,554250,680,745211,278,0005,006,0002,506,752
4Dec 19, 2025 17:326,555243,961,459211,305,0005,007,0002,510,848
5Dec 19, 2025 17:326,601243,319,946212,847,0004,996,0002,367,488
6Dec 19, 2025 17:327,112261,533,838230,693,0003,994,0002,514,944