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 20, 2026 20:23A_ShamanA_ShamanScore: 64,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 20:2364,4852,137,709,0792,075,510,00052,523,0002,113,536
2Jun 20, 2026 20:2364,6892,144,486,8442,082,116,00052,645,0002,113,536
3Jun 20, 2026 20:2364,9142,151,591,5002,091,460,00050,730,0002,113,536