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 18:19Jatin YadavJatin YadavScore: 63,540Success
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 18:1959,0301,973,221,4381,940,990,0006,996,0002,498,560
2Sep 3, 2024 18:1963,5402,120,807,4012,088,830,0007,995,0002,281,472
3Sep 3, 2024 18:1963,9542,137,680,2042,106,490,0003,997,0002,506,752