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 16:19highloadLLMhighloadLLMScore: 32,707Success
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 16:2132,5131,082,058,8591,022,979,00049,954,0002,113,536
2Jun 7, 2026 16:2132,5771,084,264,5551,026,094,00048,964,0002,113,536
3Jun 7, 2026 16:2132,6611,087,494,5791,028,481,00049,363,0002,113,536
4Jun 7, 2026 16:2132,6961,088,545,4211,029,476,00049,523,0002,113,536
5Jun 7, 2026 16:2132,7071,088,526,5401,029,717,00049,625,0002,113,536
6Jun 7, 2026 16:2132,7421,091,134,1571,031,018,00049,495,0002,113,536
7Jun 7, 2026 16:2132,9261,095,843,0601,036,573,00050,010,0002,113,536
8Jun 7, 2026 16:2133,1371,102,686,5081,043,495,00050,042,0002,113,536
9Jun 7, 2026 16:2135,5571,182,702,2881,123,609,00049,803,0002,113,536