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 listSep 29, 2022 02:05woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 330,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2022 02:05328,42310,894,276,97910,837,974,39202,318,336
2Sep 29, 2022 02:05330,10010,949,211,78010,893,303,10702,215,936
3Sep 29, 2022 02:05331,19011,001,335,11610,929,265,27902,256,896