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 listNov 11, 2024 10:06E SequeiraE SequeiraScore: 112,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 10:06111,1263,700,340,4713,655,167,00011,990,0002,457,600
2Nov 11, 2024 10:06112,4303,746,294,0803,696,206,00013,981,0002,281,472
3Nov 11, 2024 10:06116,1513,868,668,4913,820,980,00011,987,0002,281,472