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 22:05KeefeKeefeScore: 85,485Success
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 22:0584,6022,826,311,2532,775,882,00015,987,0002,281,472
2Feb 2, 2025 22:0585,4852,858,693,6152,804,018,00016,994,0002,473,984
3Feb 2, 2025 22:0586,8852,897,206,4812,847,226,00019,987,0002,486,272