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 00:19highloadLLMhighloadLLMScore: 17,630Success
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 00:2017,415583,870,445536,562,00038,144,0002,113,536
2Jun 8, 2026 00:2017,571590,418,080541,701,00038,170,0002,113,536
3Jun 8, 2026 00:2017,608590,158,676543,293,00037,786,0002,113,536
4Jun 8, 2026 00:2017,609590,329,253542,275,00038,853,0002,113,536
5Jun 8, 2026 00:2017,630590,963,831543,214,00038,607,0002,113,536
6Jun 8, 2026 00:2017,631590,927,714543,915,00037,916,0002,113,536
7Jun 8, 2026 00:2017,672592,205,933545,079,00038,102,0002,113,536
8Jun 8, 2026 00:2017,899600,221,045551,690,00038,996,0002,113,536
9Jun 8, 2026 00:2022,517760,016,406702,552,00040,509,0002,113,536