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 listJul 7, 2023 19:07Andrew EpsteinAndrew EpsteinScore: 178,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2023 19:07178,0745,931,969,0995,876,446,31502,199,552
2Jul 7, 2023 19:08178,2705,944,442,5015,882,896,82602,199,552
3Jul 7, 2023 19:08178,4555,943,874,5575,889,003,94802,191,360
4Jul 7, 2023 19:07178,9235,969,507,6715,904,461,45102,314,240
5Jul 7, 2023 19:08179,2595,975,298,3505,915,551,47902,314,240
6Jul 7, 2023 19:07179,6465,988,027,0125,928,319,84602,211,840