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 22:35highloadLLMhighloadLLMScore: 20,970Success
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 22:3720,680691,657,665640,250,00042,191,0002,113,536
2Jun 7, 2026 22:3720,829696,590,199645,043,00042,327,0002,113,536
3Jun 7, 2026 22:3720,844697,096,111644,608,00043,270,0002,113,536
4Jun 7, 2026 22:3720,878698,207,050646,349,00042,625,0002,113,536
5Jun 7, 2026 22:3720,970701,332,210649,119,00042,902,0002,113,536
6Jun 7, 2026 22:3720,974701,263,506649,409,00042,753,0002,113,536
7Jun 7, 2026 22:3720,985701,674,520650,059,00042,464,0002,113,536
8Jun 7, 2026 22:3720,995702,075,743649,503,00043,360,0002,113,536
9Jun 7, 2026 22:3721,033703,336,785651,691,00042,424,0002,113,536