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 listSep 3, 2024 20:10Jatin YadavJatin YadavScore: 100,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 20:10100,2133,331,962,4403,287,031,00019,988,0002,277,376
2Sep 3, 2024 20:10100,4523,343,615,8023,293,930,00020,986,0002,277,376
3Sep 3, 2024 20:10100,5813,344,236,2983,296,207,00022,980,0002,318,336