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 7, 2026 19:37highloadLLMhighloadLLMScore: 23,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:3822,797761,898,323710,901,00041,415,0002,113,536
2Jun 7, 2026 19:3822,808761,916,456711,627,00041,067,0002,113,536
3Jun 7, 2026 19:3822,900764,896,401714,661,00041,062,0002,113,536
4Jun 7, 2026 19:3822,928765,966,056715,128,00041,524,0002,113,536
5Jun 7, 2026 19:3823,011768,667,908717,780,00041,615,0002,113,536
6Jun 7, 2026 19:3823,067770,299,050719,742,00041,485,0002,113,536
7Jun 7, 2026 19:3823,113771,868,316720,731,00042,022,0002,113,536
8Jun 7, 2026 19:3823,120772,109,190720,457,00042,503,0002,113,536
9Jun 7, 2026 19:3823,164773,639,476722,199,00042,244,0002,113,536