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 listOct 17, 2024 11:20Sybrand AarnoutseSybrand AarnoutseScore: 201,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2024 11:20200,7276,652,527,7956,595,008,00028,986,0002,289,664
2Oct 17, 2024 11:20201,1396,668,043,9326,610,587,00026,986,0002,490,368
3Oct 17, 2024 11:20202,1876,705,272,5506,651,173,00020,987,0002,289,664