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 17:44highloadLLMhighloadLLMScore: 24,502Success
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 17:4524,264810,080,791743,400,00057,343,0002,113,536
2Jun 7, 2026 17:4524,293810,850,636744,254,00057,435,0002,113,536
3Jun 7, 2026 17:4524,455816,284,160748,110,00058,912,0002,113,536
4Jun 7, 2026 17:4524,457816,275,606748,727,00058,359,0002,113,536
5Jun 7, 2026 17:4524,502817,753,856750,036,00058,555,0002,113,536
6Jun 7, 2026 17:4524,510818,128,444750,680,00058,153,0002,113,536
7Jun 7, 2026 17:4524,511818,000,373750,431,00058,445,0002,113,536
8Jun 7, 2026 17:4524,598820,888,014753,963,00057,783,0002,113,536
9Jun 7, 2026 17:4524,611821,199,432753,858,00058,306,0002,113,536