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 listOct 23, 2025 19:38Rashin SergeyRashin SergeyScore: 489,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 19:38488,19816,149,439,44616,024,580,00085,944,0002,289,664
2Oct 23, 2025 19:38488,24916,150,002,63516,029,262,00082,944,0002,494,464
3Oct 23, 2025 19:38488,28516,154,579,63816,017,477,00095,936,0002,510,848
4Oct 23, 2025 19:38488,51616,158,072,19616,017,085,000103,929,0002,457,600
5Oct 23, 2025 19:38489,19216,185,366,80116,053,411,00089,940,0002,502,656
6Oct 23, 2025 19:38489,72316,207,495,41016,065,926,00094,934,0002,330,624
7Oct 23, 2025 19:38491,30016,250,094,80016,117,976,00094,935,0002,416,640
8Oct 23, 2025 19:38492,63116,287,266,20916,154,895,000101,942,0002,277,376
9Oct 23, 2025 19:38493,15316,314,155,85116,171,106,000102,943,0002,424,832