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 19:58highloadLLMhighloadLLMScore: 21,923Success
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 20:0021,753727,301,190670,933,00046,926,0002,113,536
2Jun 7, 2026 20:0021,796728,491,775672,368,00046,927,0002,113,536
3Jun 7, 2026 20:0021,821729,233,888672,708,00047,387,0002,113,536
4Jun 7, 2026 20:0021,871730,830,212674,056,00047,688,0002,113,536
5Jun 7, 2026 20:0021,923732,613,409675,993,00047,473,0002,113,536
6Jun 7, 2026 20:0021,925732,737,998676,118,00047,431,0002,113,536
7Jun 7, 2026 20:0021,950733,519,927677,504,00046,874,0002,113,536
8Jun 7, 2026 20:0021,957733,819,461677,098,00047,515,0002,113,536
9Jun 7, 2026 20:0022,014735,684,128678,629,00047,834,0002,113,536