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 listFeb 2, 2025 21:44KeefeKeefeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 21:4400000Error: expected "1023178 ", got "145952 "
2Feb 2, 2025 21:4400000Error: expected "1024946 ", got "145951 "
3Feb 2, 2025 21:4500000Error: expected "1024570 ", got "145925 "
4Feb 2, 2025 21:4600000Error: expected "1024672 ", got "145953 "