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 listJul 11, 2023 14:59Andrew EpsteinAndrew EpsteinScore: 255,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2023 14:59254,8748,473,310,9218,410,831,99302,224,128
2Jul 11, 2023 14:59255,4048,490,283,9428,428,347,41702,220,032
3Jul 11, 2023 14:59256,6978,532,589,1408,471,000,24102,224,128