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 listJun 15, 2024 23:23Joad NacerJoad NacerScore: 7,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2024 23:237,180304,244,636236,924,12302,228,224
2Jun 15, 2024 23:257,187295,077,541237,165,06402,351,104
3Jun 15, 2024 23:257,191316,005,439237,301,98302,228,224
4Jun 15, 2024 23:237,240306,069,907238,903,68302,355,200
5Jun 15, 2024 23:237,252303,877,907239,311,88602,211,840
6Jun 15, 2024 23:257,258294,429,014239,513,55202,228,224