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 22:57highloadLLMhighloadLLMScore: 17,713Success
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 22:5817,442584,852,686537,290,00038,298,0002,113,536
2Jun 7, 2026 22:5817,577589,332,943542,150,00037,901,0002,113,536
3Jun 7, 2026 22:5817,640591,289,215543,990,00038,151,0002,113,536
4Jun 7, 2026 22:5817,693593,072,852545,577,00038,312,0002,113,536
5Jun 7, 2026 22:5817,713593,701,725546,355,00038,193,0002,113,536
6Jun 7, 2026 22:5817,798596,527,436549,403,00037,957,0002,113,536
7Jun 7, 2026 22:5817,851598,353,006551,150,00037,963,0002,113,536
8Jun 7, 2026 22:5818,025604,129,939555,752,00039,075,0002,113,536
9Jun 7, 2026 22:5818,127609,062,170560,007,00038,186,0002,113,536