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 listMay 28, 2024 18:09Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2024 18:0900000Error: expected "1025812 ", got "1025146 "stderr
2May 28, 2024 18:097,275303,270,591240,065,97102,232,320
3May 28, 2024 18:097,298307,551,734240,844,62202,228,224
4May 28, 2024 18:097,330311,858,122241,880,41602,224,128
5May 28, 2024 18:097,334293,764,501242,014,32602,224,128
6May 28, 2024 18:097,350306,970,310242,538,66702,228,224
7May 28, 2024 18:097,358309,890,634242,809,45102,232,320