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 20:43highloadLLMhighloadLLMScore: 19,686Success
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:4419,465651,544,116603,525,00038,828,0002,113,536
2Jun 7, 2026 20:4419,551654,341,037606,079,00039,131,0002,113,536
3Jun 7, 2026 20:4419,562654,710,097606,240,00039,328,0002,113,536
4Jun 7, 2026 20:4419,651657,733,862609,903,00038,585,0002,113,536
5Jun 7, 2026 20:4419,686659,003,941611,351,00038,290,0002,113,536
6Jun 7, 2026 20:4419,693659,116,388610,569,00039,302,0002,113,536
7Jun 7, 2026 20:4419,778662,021,390613,837,00038,840,0002,113,536
8Jun 7, 2026 20:4419,849664,197,503614,963,00040,061,0002,113,536
9Jun 7, 2026 20:4419,924666,789,120618,642,00038,875,0002,113,536