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 23:02highloadLLMhighloadLLMScore: 18,102Success
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 23:0517,638591,250,596544,239,00037,847,0002,113,536
2Jun 7, 2026 23:0517,855598,369,745550,329,00038,905,0002,113,536
3Jun 7, 2026 23:0517,965601,943,627554,265,00038,610,0002,113,536
4Jun 7, 2026 23:0518,090605,987,126558,475,00038,498,0002,113,536
5Jun 7, 2026 23:0518,102606,512,544558,687,00038,706,0002,113,536
6Jun 7, 2026 23:0518,150608,149,453559,653,00039,317,0002,113,536
7Jun 7, 2026 23:0518,227610,673,508563,005,00038,514,0002,113,536
8Jun 7, 2026 23:0518,247611,339,017563,534,00038,646,0002,113,536
9Jun 7, 2026 23:0518,379615,692,458567,912,00038,605,0002,113,536