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:13highloadLLMhighloadLLMScore: 17,832Success
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:1617,412583,739,844536,386,00038,240,0002,113,536
2Jun 7, 2026 23:1617,491586,402,844538,556,00038,670,0002,113,536
3Jun 7, 2026 23:1617,816598,423,992550,222,00037,707,0002,113,536
4Jun 7, 2026 23:1617,827597,590,666550,418,00037,905,0002,113,536
5Jun 7, 2026 23:1617,832597,561,330549,974,00038,498,0002,113,536
6Jun 7, 2026 23:1617,937601,108,270553,585,00038,359,0002,113,536
7Jun 7, 2026 23:1617,967601,883,565553,962,00038,963,0002,113,536
8Jun 7, 2026 23:1618,098606,378,757559,005,00038,261,0002,113,536
9Jun 7, 2026 23:1618,126607,312,425559,981,00038,201,0002,113,536