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 8, 2026 02:06highloadLLMhighloadLLMScore: 16,119Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:0715,972536,512,191389,724,000137,376,0002,113,536
2Jun 8, 2026 02:0715,995537,026,325388,711,000139,133,0002,113,536
3Jun 8, 2026 02:0715,996537,093,179390,165,000137,725,0002,113,536
4Jun 8, 2026 02:0716,011538,858,914390,985,000137,396,0002,113,536
5Jun 8, 2026 02:0716,119541,291,493389,645,000142,302,0002,113,536
6Jun 8, 2026 02:0716,129541,612,270391,584,000140,700,0002,113,536
7Jun 8, 2026 02:0716,138541,900,467389,702,000142,864,0002,113,536
8Jun 8, 2026 02:0716,152542,241,044390,931,000142,091,0002,113,536
9Jun 8, 2026 02:0716,204544,001,915389,327,000145,414,0002,113,536