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 13, 2025 00:07Leon ZhaoLeon ZhaoScore: 15,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 00:0715,521547,262,293501,213,00010,982,0002,301,952
2Aug 13, 2025 00:0715,549536,387,719501,144,00011,979,0002,387,968
3Aug 13, 2025 00:0715,559537,478,221499,465,00013,985,0002,392,064
4Aug 13, 2025 00:0715,615541,296,931506,302,0008,987,0002,420,736
5Aug 13, 2025 00:0715,630541,459,968502,784,00012,994,0002,465,792
6Aug 13, 2025 00:0715,648544,060,291507,385,0008,989,0002,465,792
7Aug 13, 2025 00:0715,668548,687,231505,080,00011,978,0002,285,568
8Aug 13, 2025 00:0715,767548,693,951509,333,00010,985,0002,461,696
9Aug 13, 2025 00:0715,811553,239,912508,774,00012,994,0002,519,040