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 18:33highloadLLMhighloadLLMScore: 31,903Success
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 18:3431,8091,058,935,7951,000,895,00048,827,0002,113,536
2Jun 7, 2026 18:3431,8231,059,393,5541,000,585,00049,589,0002,113,536
3Jun 7, 2026 18:3431,8241,059,323,8841,000,731,00049,477,0002,113,536
4Jun 7, 2026 18:3431,8701,060,919,8611,001,682,00050,055,0002,113,536
5Jun 7, 2026 18:3431,9031,061,996,7501,003,463,00049,361,0002,113,536
6Jun 7, 2026 18:3431,9251,062,715,1401,003,906,00049,649,0002,113,536
7Jun 7, 2026 18:3432,0311,066,123,3321,007,153,00049,879,0002,113,536
8Jun 7, 2026 18:3432,0321,066,248,3831,006,598,00050,471,0002,113,536
9Jun 7, 2026 18:3432,2771,075,978,3271,014,811,00050,338,0002,113,536