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 listAug 28, 2022 15:45Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2022 15:4600000Error: expected "1020310 ", got "1020309"
2Aug 28, 2022 15:4574,3942,509,418,6722,455,009,94902,260,992
3Aug 28, 2022 15:4575,2342,546,353,2952,482,732,83302,273,280
4Aug 28, 2022 15:4575,2652,554,489,6582,483,759,04402,289,664