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 15, 2025 14:49Pavitra GolchhaPavitra GolchhaScore: 81,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 14:4980,4632,682,374,5602,512,385,000142,908,0002,285,568
2Dec 15, 2025 14:4980,4672,682,813,4172,511,487,000143,913,0002,285,568
3Dec 15, 2025 14:4980,6542,689,391,0762,520,645,000140,924,0002,285,568
4Dec 15, 2025 14:4981,0782,704,341,2632,532,637,000142,923,0002,428,928
5Dec 15, 2025 14:4981,1262,705,204,2732,536,264,000140,903,0002,285,568
6Dec 15, 2025 14:4981,2592,715,767,0712,540,615,000140,923,0002,363,392
7Dec 15, 2025 14:4981,3752,717,215,8012,540,466,000144,912,0002,433,024
8Dec 15, 2025 14:4981,9022,727,797,8372,563,827,000138,936,0002,277,376
9Dec 15, 2025 14:4994,1313,136,635,2242,962,461,000143,876,0002,285,568