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:29Jatin YadavJatin YadavScore: 61,142Success
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:2959,5221,995,598,8571,956,223,0007,992,0002,514,944
2Sep 3, 2024 18:2961,1422,042,813,5222,011,696,0005,996,0002,281,472
3Sep 3, 2024 18:2964,5112,160,637,8202,119,879,0008,995,0002,502,656