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 3, 2023 09:14matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2023 09:1400000Error: expected "1025408 ", got "1025407 "stderr
2Sep 3, 2023 09:1400000Error: expected "1024376 ", got "1024375 "stderr
3Sep 3, 2023 09:1511,752446,336,907387,819,46402,277,376
4Sep 3, 2023 09:1511,904464,665,400392,837,65402,277,376
5Sep 3, 2023 09:1512,083470,680,986398,750,37602,273,280