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 listMay 24, 2025 15:40Emanuele BolognesiEmanuele BolognesiScore: 47,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2025 15:4047,0101,574,159,8381,478,370,00072,968,0002,486,272
2May 24, 2025 15:4047,0591,579,340,7881,488,997,00063,956,0002,383,872
3May 24, 2025 15:4047,6021,601,064,3041,493,907,00076,943,0002,285,568
4May 24, 2025 15:4047,6991,605,072,8491,500,121,00073,956,0002,441,216
5May 24, 2025 15:4047,7201,601,529,3941,495,831,00078,938,0002,449,408
6May 24, 2025 15:4047,7401,599,238,5281,500,446,00074,972,0002,359,296
7May 24, 2025 15:4047,9971,607,779,7051,515,952,00067,953,0002,473,984
8May 24, 2025 15:4048,0161,621,911,7931,506,595,00077,927,0002,416,640
9May 24, 2025 15:4048,0461,614,963,5101,517,574,00067,936,0002,473,984