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 16, 2026 19:52M-RochatM-RochatScore: 23,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 19:5822,991768,309,643753,674,0005,029,0002,113,536
2May 16, 2026 19:5823,101772,175,772757,170,0005,186,0002,113,536
3May 16, 2026 19:5823,109774,869,890757,449,0005,164,0002,113,536
4May 16, 2026 19:5823,253776,271,388762,351,0005,017,0002,113,536
5May 16, 2026 19:5823,291779,936,437763,502,0005,118,0002,113,536
6May 16, 2026 19:5823,447782,812,292768,673,0005,096,0002,113,536
7May 16, 2026 19:5823,559786,354,741772,305,0005,154,0002,113,536
8May 16, 2026 19:5824,185807,046,490793,076,0005,059,0002,113,536
9May 16, 2026 19:5825,780873,291,345845,652,0005,104,0002,113,536