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 23:42highloadLLMhighloadLLMScore: 24,181Success
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 23:4323,493786,057,327734,908,00040,387,0002,113,536
2Jun 7, 2026 23:4323,531785,774,522736,148,00040,388,0002,113,536
3Jun 7, 2026 23:4323,765793,667,254743,421,00040,852,0002,113,536
4Jun 7, 2026 23:4323,773793,792,636744,212,00040,307,0002,113,536
5Jun 7, 2026 23:4324,181807,086,609757,409,00040,573,0002,113,536
6Jun 7, 2026 23:4324,193807,506,955757,625,00040,751,0002,113,536
7Jun 7, 2026 23:4324,200807,949,850757,396,00041,225,0002,113,536
8Jun 7, 2026 23:4324,276810,243,683760,726,00040,402,0002,113,536
9Jun 7, 2026 23:4324,296811,157,655761,724,00040,045,0002,113,536