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 listMay 13, 2026 05:13Josu San MartinJosu San MartinScore: 3,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 05:143,617128,641,024118,255,0001,119,0002,113,536
2May 13, 2026 05:143,623128,349,274118,511,0001,048,0002,113,536
3May 13, 2026 05:143,625129,014,396118,520,0001,126,0002,113,536
4May 13, 2026 05:143,626130,601,524118,636,0001,036,0002,113,536
5May 13, 2026 05:143,629130,792,069118,646,0001,120,0002,113,536
6May 13, 2026 05:143,632129,713,200118,824,0001,053,0002,113,536
7May 13, 2026 05:143,645129,085,213119,239,0001,051,0002,113,536
8May 13, 2026 05:143,657129,389,094119,561,0001,131,0002,113,536
9May 13, 2026 05:143,669129,894,508119,948,0001,141,0002,113,536