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 18:04highloadLLMhighloadLLMScore: 30,227Success
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 18:0530,1751,005,115,271941,903,00053,894,0002,113,536
2Jun 7, 2026 18:0530,1941,005,804,069941,810,00054,610,0002,113,536
3Jun 7, 2026 18:0530,2081,006,250,004943,049,00053,843,0002,113,536
4Jun 7, 2026 18:0530,2141,006,361,319943,707,00053,381,0002,113,536
5Jun 7, 2026 18:0530,2271,006,900,160943,984,00053,520,0002,113,536
6Jun 7, 2026 18:0530,3041,011,101,750946,640,00053,404,0002,113,536
7Jun 7, 2026 18:0530,3971,012,770,779949,268,00053,845,0002,113,536
8Jun 7, 2026 18:0530,4131,012,996,660948,868,00054,762,0002,113,536
9Jun 7, 2026 18:0530,4281,015,333,325950,763,00053,386,0002,113,536