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 listJun 23, 2025 04:13Ian MckibbenIan MckibbenScore: 508,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 04:13507,92516,796,134,97316,669,579,00091,937,0002,453,504
2Jun 23, 2025 04:13508,69416,821,385,80516,678,953,000107,934,0002,330,624
3Jun 23, 2025 04:13510,23716,874,273,93816,734,893,000102,937,0002,375,680