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 21:06highloadLLMhighloadLLMScore: 18,875Success
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 21:0818,720626,963,009578,217,00039,561,0002,113,536
2Jun 7, 2026 21:0818,774628,733,628580,457,00039,111,0002,113,536
3Jun 7, 2026 21:0818,799629,537,351581,576,00038,812,0002,113,536
4Jun 7, 2026 21:0818,851631,286,691583,676,00038,429,0002,113,536
5Jun 7, 2026 21:0818,875632,059,069583,335,00039,556,0002,113,536
6Jun 7, 2026 21:0818,875632,110,905583,366,00039,516,0002,113,536
7Jun 7, 2026 21:0818,903633,061,005585,038,00038,793,0002,113,536
8Jun 7, 2026 21:0819,025637,080,191587,906,00039,930,0002,113,536
9Jun 7, 2026 21:0819,028637,223,306589,493,00038,449,0002,113,536