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 11, 2025 15:51Rajarshi BasuRajarshi BasuScore: 22,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:5121,905747,894,865710,869,00011,997,0002,404,352
2Dec 11, 2025 15:5121,951756,187,340707,386,00016,985,0002,338,816
3Dec 11, 2025 15:5121,975763,809,013707,196,00017,979,0002,408,448
4Dec 11, 2025 15:5121,990754,455,694708,692,00016,992,0002,473,984
5Dec 11, 2025 15:5122,007757,201,081708,257,00017,981,0002,383,872
6Dec 11, 2025 15:5122,120759,652,776713,955,00015,998,0002,379,776
7Dec 11, 2025 15:5122,372764,924,759726,285,00011,988,0002,322,432
8Dec 11, 2025 15:5123,877817,912,357771,974,00015,978,0002,387,968
9Dec 11, 2025 15:5123,955822,583,797774,534,00015,969,0002,375,680