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: 60,934Success
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:1260,3172,018,044,2601,927,515,00062,951,0002,277,376
2Dec 5, 2025 10:1260,3862,027,384,1081,929,807,00062,928,0002,277,376
3Dec 5, 2025 10:1260,7182,031,821,9251,944,776,00058,932,0002,437,120
4Dec 5, 2025 10:1260,8502,036,262,3541,954,069,00053,974,0002,486,272
5Dec 5, 2025 10:1260,9342,041,339,2501,960,852,00049,970,0002,285,568
6Dec 5, 2025 10:1261,0002,040,367,9101,966,029,00046,976,0002,277,376
7Dec 5, 2025 10:1261,1182,047,580,3241,956,942,00059,967,0002,273,280
8Dec 5, 2025 10:1261,2192,051,414,4931,972,238,00047,981,0002,392,064
9Dec 5, 2025 10:1261,2242,047,412,4451,965,425,00054,983,0002,437,120