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 18:59highloadLLMhighloadLLMScore: 24,167Success
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 19:0024,089804,200,646742,746,00052,194,0002,113,536
2Jun 7, 2026 19:0024,103804,591,218742,161,00053,267,0002,113,536
3Jun 7, 2026 19:0024,119805,247,156743,204,00052,754,0002,113,536
4Jun 7, 2026 19:0024,166806,609,209744,020,00053,471,0002,113,536
5Jun 7, 2026 19:0024,167806,740,751743,556,00053,980,0002,113,536
6Jun 7, 2026 19:0024,211808,048,473745,995,00052,986,0002,113,536
7Jun 7, 2026 19:0024,282810,460,550747,991,00053,316,0002,113,536
8Jun 7, 2026 19:0024,342812,446,914748,676,00054,639,0002,113,536
9Jun 7, 2026 19:0024,359813,005,729749,599,00054,251,0002,113,536