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 5, 2024 13:39Joad NacerJoad NacerScore: 18,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2024 13:3818,252658,550,926602,304,91602,281,472
2May 5, 2024 13:3818,310674,751,807604,229,78602,273,280
3May 5, 2024 13:3918,749683,703,072618,712,00202,260,992
4May 5, 2024 13:3818,796691,167,528620,272,08602,260,992
5May 5, 2024 13:3918,800678,181,639620,402,51402,273,280
6May 5, 2024 13:3918,859680,886,733622,354,62902,265,088