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 31, 2025 13:17Aniruddha DebAniruddha DebScore: 8,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 13:178,901314,402,304251,782,00041,963,0002,285,568
2Dec 31, 2025 13:178,919317,626,250253,408,00040,904,0002,445,312
3Dec 31, 2025 13:178,928317,377,447237,700,00056,928,0002,498,560
4Dec 31, 2025 13:178,960316,894,273252,722,00042,952,0002,289,664
5Dec 31, 2025 13:178,966321,749,460256,884,00038,982,0002,502,656
6Dec 31, 2025 13:178,967320,883,405256,918,00038,987,0002,289,664
7Dec 31, 2025 13:179,015321,412,072247,569,00049,913,0002,371,584
8Dec 31, 2025 13:179,043324,677,395250,515,00047,907,0002,277,376
9Dec 31, 2025 13:179,055328,405,785247,849,00050,969,0002,486,272