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:06highloadLLMhighloadLLMScore: 23,533Success
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:0723,380780,839,058720,348,00051,197,0002,113,536
2Jun 7, 2026 19:0723,457783,347,116721,765,00052,341,0002,113,536
3Jun 7, 2026 19:0723,476784,004,855721,966,00052,770,0002,113,536
4Jun 7, 2026 19:0723,486784,180,129722,500,00052,562,0002,113,536
5Jun 7, 2026 19:0723,533785,763,113723,817,00052,772,0002,113,536
6Jun 7, 2026 19:0723,548786,259,958724,076,00053,028,0002,113,536
7Jun 7, 2026 19:0723,603788,190,444726,586,00052,344,0002,113,536
8Jun 7, 2026 19:0723,633789,107,456727,241,00052,669,0002,113,536
9Jun 7, 2026 19:0723,733792,993,111729,348,00053,853,0002,113,536