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 17:17highloadLLMhighloadLLMScore: 25,579Success
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 17:1825,482850,343,636791,079,00049,852,0002,113,536
2Jun 7, 2026 17:1825,538852,153,732792,051,00050,735,0002,113,536
3Jun 7, 2026 17:1825,550852,696,216793,376,00049,789,0002,113,536
4Jun 7, 2026 17:1825,561853,283,583793,885,00049,651,0002,113,536
5Jun 7, 2026 17:1825,579853,477,310794,758,00049,355,0002,113,536
6Jun 7, 2026 17:1825,814861,682,403801,345,00050,522,0002,113,536
7Jun 7, 2026 17:1825,817861,739,723801,128,00050,844,0002,113,536
8Jun 7, 2026 17:1825,943865,459,251805,064,00051,070,0002,113,536
9Jun 7, 2026 17:1825,980867,056,706806,372,00050,973,0002,113,536