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 8, 2026 05:01highloadLLMhighloadLLMScore: 11,534Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 05:0311,506389,068,156311,247,00068,451,0002,113,536
2Jun 8, 2026 05:0311,523389,554,354311,194,00069,068,0002,113,536
3Jun 8, 2026 05:0311,525390,230,106311,192,00069,157,0002,113,536
4Jun 8, 2026 05:0311,526389,720,729311,393,00068,973,0002,113,536
5Jun 8, 2026 05:0311,534390,116,210311,753,00068,901,0002,113,536
6Jun 8, 2026 05:0311,535390,053,970311,581,00069,105,0002,113,536
7Jun 8, 2026 05:0311,546390,836,254312,204,00068,823,0002,113,536
8Jun 8, 2026 05:0311,570391,189,091311,576,00070,259,0002,113,536
9Jun 8, 2026 05:0311,631393,650,342313,590,00070,260,0002,113,536