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 listAug 12, 2025 23:06Leon ZhaoLeon ZhaoScore: 17,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 23:0617,622609,551,456513,593,00067,946,0002,449,408
2Aug 12, 2025 23:0617,742610,947,351523,547,00061,946,0002,322,432
3Aug 12, 2025 23:0617,748607,690,594526,713,00058,967,0002,457,600