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 26, 2022 12:40Bernard 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 26, 2022 12:4000000Error: expected "1023838 ", got "1023836"
2Aug 26, 2022 12:5600000Error: expected "1024308 ", got "1024307"
3Aug 26, 2022 12:4411,962473,292,125394,755,13502,289,664
4Aug 26, 2022 12:4411,988454,765,058395,602,50002,273,280
5Aug 26, 2022 12:4413,073501,850,094431,395,06702,289,664