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 27, 2026 18:41Victor MerckléVictor MerckléScore: 3,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 18:413,398119,997,207111,023,0001,115,0002,113,536
2Jun 27, 2026 18:413,401120,074,256111,103,0001,150,0002,113,536
3Jun 27, 2026 18:413,402120,041,439111,185,0001,103,0002,113,536
4Jun 27, 2026 18:413,408120,762,190111,308,0001,167,0002,113,536
5Jun 27, 2026 18:413,417120,548,135111,660,0001,114,0002,113,536
6Jun 27, 2026 18:413,420120,965,263111,511,0001,366,0002,113,536
7Jun 27, 2026 18:413,424120,769,013111,806,0001,197,0002,113,536
8Jun 27, 2026 18:413,795141,559,562124,046,0001,204,0002,113,536
9Jun 27, 2026 18:414,047150,280,834132,300,0001,251,0002,113,536