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 5, 2025 10:12CadovvlCadovvlScore: 72,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 10:1271,4252,383,345,0692,298,090,00058,951,0002,445,312
2Dec 5, 2025 10:1271,4952,387,109,0142,308,358,00050,963,0002,277,376
3Dec 5, 2025 10:1271,7192,394,611,8472,304,785,00061,940,0002,519,040
4Dec 5, 2025 10:1271,9802,403,297,9752,312,396,00062,956,0002,486,272
5Dec 5, 2025 10:1272,6662,430,669,9732,350,012,00047,979,0002,449,408
6Dec 5, 2025 10:1272,7812,427,925,9772,352,786,00048,974,0002,277,376
7Dec 5, 2025 10:1272,8752,433,453,3792,364,880,00039,981,0002,277,376
8Dec 5, 2025 10:1273,0362,444,695,7912,356,217,00053,959,0002,433,024
9Dec 5, 2025 10:1273,2872,447,127,2692,362,515,00055,964,0002,277,376